./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7 --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 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:04:23,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:04:23,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:04:23,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:04:23,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:04:23,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:04:23,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:04:23,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:04:23,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:04:23,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:04:23,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:04:23,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:04:23,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:04:23,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:04:23,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:04:23,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:04:23,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:04:23,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:04:23,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:04:23,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:04:23,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:04:23,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:04:23,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:04:23,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:04:23,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:04:23,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:04:23,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:04:23,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:04:23,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:04:23,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:04:23,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:04:23,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:04:23,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:04:23,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:04:23,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:04:23,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:04:23,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:04:23,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:04:23,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:04:23,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:04:23,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:04:23,906 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-25 18:04:23,950 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:04:23,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:04:23,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:04:23,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:04:23,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:04:23,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:04:23,953 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:04:23,953 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:04:23,954 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:04:23,954 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:04:23,955 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:04:23,955 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:04:23,956 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:04:23,956 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:04:23,956 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:04:23,956 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:04:23,957 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:04:23,957 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:04:23,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 18:04:23,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 18:04:23,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:04:23,959 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:04:23,959 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 18:04:23,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:04:23,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:04:23,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:04:23,961 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 18:04:23,962 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 18:04:23,962 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 18:04:23,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:04:23,962 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 18:04:23,963 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:04:23,963 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:04:23,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:04:23,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:04:23,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:04:23,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:04:23,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:04:23,964 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:04:23,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:04:23,965 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:04:23,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:04:23,965 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/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_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7 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 -> 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 [2021-11-25 18:04:24,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:04:24,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:04:24,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:04:24,316 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:04:24,317 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:04:24,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2021-11-25 18:04:24,387 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/data/937c9a218/933841ab00d2422eabc3274730d8a804/FLAG70ad0fc09 [2021-11-25 18:04:24,881 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:04:24,881 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2021-11-25 18:04:24,892 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/data/937c9a218/933841ab00d2422eabc3274730d8a804/FLAG70ad0fc09 [2021-11-25 18:04:25,254 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/data/937c9a218/933841ab00d2422eabc3274730d8a804 [2021-11-25 18:04:25,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:04:25,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:04:25,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:04:25,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:04:25,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:04:25,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdcf473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25, skipping insertion in model container [2021-11-25 18:04:25,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:04:25,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:04:25,515 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:04:25,524 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:04:25,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:04:25,575 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:04:25,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25 WrapperNode [2021-11-25 18:04:25,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:04:25,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:04:25,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:04:25,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:04:25,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,627 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2021-11-25 18:04:25,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:04:25,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:04:25,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:04:25,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:04:25,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:04:25,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:04:25,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:04:25,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:04:25,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (1/1) ... [2021-11-25 18:04:25,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:04:25,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:25,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:04:25,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:04:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:04:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:04:25,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:04:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:04:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:04:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:04:25,842 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:04:25,845 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:04:25,997 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:04:26,036 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:04:26,036 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-25 18:04:26,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:04:26 BoogieIcfgContainer [2021-11-25 18:04:26,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:04:26,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:04:26,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:04:26,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:04:26,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:04:25" (1/3) ... [2021-11-25 18:04:26,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306d2422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:04:26, skipping insertion in model container [2021-11-25 18:04:26,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:04:25" (2/3) ... [2021-11-25 18:04:26,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306d2422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:04:26, skipping insertion in model container [2021-11-25 18:04:26,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:04:26" (3/3) ... [2021-11-25 18:04:26,049 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-write.c [2021-11-25 18:04:26,055 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:04:26,055 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-11-25 18:04:26,127 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:04:26,147 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:04:26,148 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-25 18:04:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 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) [2021-11-25 18:04:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:04:26,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:26,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:04:26,184 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash 3271901, now seen corresponding path program 1 times [2021-11-25 18:04:26,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:26,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143451179] [2021-11-25 18:04:26,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:26,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:26,427 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:26,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143451179] [2021-11-25 18:04:26,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143451179] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:26,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:04:26,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:04:26,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341286483] [2021-11-25 18:04:26,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:26,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:04:26,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:04:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:04:26,498 INFO L87 Difference]: Start difference. First operand has 19 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:26,596 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-11-25 18:04:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:04:26,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-25 18:04:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:26,606 INFO L225 Difference]: With dead ends: 37 [2021-11-25 18:04:26,606 INFO L226 Difference]: Without dead ends: 35 [2021-11-25 18:04:26,608 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:04:26,613 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:26,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 16 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-25 18:04:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2021-11-25 18:04:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 19 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) [2021-11-25 18:04:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-25 18:04:26,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 4 [2021-11-25 18:04:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:26,647 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-25 18:04:26,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-25 18:04:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:04:26,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:26,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:04:26,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:04:26,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 3197824, now seen corresponding path program 1 times [2021-11-25 18:04:26,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:26,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723069595] [2021-11-25 18:04:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:26,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:26,730 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:26,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723069595] [2021-11-25 18:04:26,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723069595] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:26,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:04:26,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:04:26,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48567317] [2021-11-25 18:04:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:26,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:04:26,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:26,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:04:26,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:04:26,734 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:26,774 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2021-11-25 18:04:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:04:26,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-25 18:04:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:26,776 INFO L225 Difference]: With dead ends: 37 [2021-11-25 18:04:26,776 INFO L226 Difference]: Without dead ends: 37 [2021-11-25 18:04:26,777 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:04:26,779 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:26,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:04:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-25 18:04:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2021-11-25 18:04:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 21 states have internal predecessors, (26), 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) [2021-11-25 18:04:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-11-25 18:04:26,786 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 4 [2021-11-25 18:04:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:26,786 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-25 18:04:26,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-11-25 18:04:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:04:26,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:26,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:04:26,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:04:26,788 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash 3199854, now seen corresponding path program 1 times [2021-11-25 18:04:26,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:26,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009864380] [2021-11-25 18:04:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:26,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:26,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:26,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009864380] [2021-11-25 18:04:26,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009864380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:26,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:04:26,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:04:26,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567627784] [2021-11-25 18:04:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:26,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:04:26,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:26,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:04:26,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:04:26,859 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:26,953 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-11-25 18:04:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:04:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-25 18:04:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:26,955 INFO L225 Difference]: With dead ends: 42 [2021-11-25 18:04:26,955 INFO L226 Difference]: Without dead ends: 42 [2021-11-25 18:04:26,956 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:04:26,958 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:26,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-25 18:04:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2021-11-25 18:04:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-25 18:04:26,964 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 4 [2021-11-25 18:04:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:26,965 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-25 18:04:26,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-25 18:04:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:04:26,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:26,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:04:26,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:04:26,967 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 99132597, now seen corresponding path program 1 times [2021-11-25 18:04:26,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:26,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87921649] [2021-11-25 18:04:26,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:26,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:27,054 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:27,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87921649] [2021-11-25 18:04:27,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87921649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:27,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:04:27,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:04:27,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631293843] [2021-11-25 18:04:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:27,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:04:27,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:27,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:04:27,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:04:27,058 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) [2021-11-25 18:04:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:27,094 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-11-25 18:04:27,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:04:27,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 [2021-11-25 18:04:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:27,097 INFO L225 Difference]: With dead ends: 22 [2021-11-25 18:04:27,097 INFO L226 Difference]: Without dead ends: 22 [2021-11-25 18:04:27,097 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:04:27,099 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:27,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:04:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-25 18:04:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-25 18:04:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 21 states have internal predecessors, (26), 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) [2021-11-25 18:04:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-11-25 18:04:27,105 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2021-11-25 18:04:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:27,105 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-25 18:04:27,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) [2021-11-25 18:04:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-11-25 18:04:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:04:27,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:27,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:04:27,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:04:27,108 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:27,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 99132598, now seen corresponding path program 1 times [2021-11-25 18:04:27,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:27,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374955060] [2021-11-25 18:04:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:27,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:27,232 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374955060] [2021-11-25 18:04:27,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374955060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:27,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:04:27,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:04:27,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219444381] [2021-11-25 18:04:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:27,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:04:27,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:04:27,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:04:27,238 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) [2021-11-25 18:04:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:27,328 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-11-25 18:04:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:04:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 [2021-11-25 18:04:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:27,331 INFO L225 Difference]: With dead ends: 35 [2021-11-25 18:04:27,331 INFO L226 Difference]: Without dead ends: 35 [2021-11-25 18:04:27,332 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:04:27,339 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:27,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-25 18:04:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2021-11-25 18:04:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-25 18:04:27,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2021-11-25 18:04:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:27,354 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-25 18:04:27,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) [2021-11-25 18:04:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-25 18:04:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 18:04:27,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:27,360 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-11-25 18:04:27,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 18:04:27,360 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 777193832, now seen corresponding path program 1 times [2021-11-25 18:04:27,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:27,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209558040] [2021-11-25 18:04:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:27,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:27,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:27,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209558040] [2021-11-25 18:04:27,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209558040] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243657544] [2021-11-25 18:04:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:27,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:27,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:27,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:04:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:27,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:04:27,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:27,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:27,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243657544] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1798991153] [2021-11-25 18:04:27,745 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2021-11-25 18:04:27,746 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:27,753 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:27,763 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:27,763 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:27,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:27,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:28,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:28,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:28,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:28,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:28,408 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:28,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1798991153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:28,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:28,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 3] total 8 [2021-11-25 18:04:28,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496141459] [2021-11-25 18:04:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:28,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:04:28,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:28,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:04:28,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:04:28,602 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2021-11-25 18:04:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:29,006 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-11-25 18:04:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:04:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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 7 [2021-11-25 18:04:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:29,007 INFO L225 Difference]: With dead ends: 30 [2021-11-25 18:04:29,007 INFO L226 Difference]: Without dead ends: 30 [2021-11-25 18:04:29,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:04:29,009 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:29,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-25 18:04:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-11-25 18:04:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 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) [2021-11-25 18:04:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-11-25 18:04:29,014 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2021-11-25 18:04:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:29,014 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-25 18:04:29,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2021-11-25 18:04:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-11-25 18:04:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 18:04:29,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:29,016 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2021-11-25 18:04:29,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:29,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:29,217 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1676794930, now seen corresponding path program 1 times [2021-11-25 18:04:29,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:29,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87025835] [2021-11-25 18:04:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:29,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:04:29,287 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:29,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87025835] [2021-11-25 18:04:29,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87025835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:29,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:04:29,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:04:29,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535452429] [2021-11-25 18:04:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:29,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:04:29,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:29,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:04:29,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:04:29,290 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2021-11-25 18:04:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:29,372 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-11-25 18:04:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:04:29,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 8 [2021-11-25 18:04:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:29,376 INFO L225 Difference]: With dead ends: 40 [2021-11-25 18:04:29,377 INFO L226 Difference]: Without dead ends: 40 [2021-11-25 18:04:29,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:04:29,379 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:29,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 14 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-25 18:04:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2021-11-25 18:04:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 24 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) [2021-11-25 18:04:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-11-25 18:04:29,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 8 [2021-11-25 18:04:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:29,390 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-11-25 18:04:29,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2021-11-25 18:04:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-11-25 18:04:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:04:29,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:29,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:29,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 18:04:29,392 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:29,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -725463176, now seen corresponding path program 1 times [2021-11-25 18:04:29,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:29,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537287704] [2021-11-25 18:04:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:29,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:04:29,462 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:29,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537287704] [2021-11-25 18:04:29,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537287704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:29,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:04:29,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:04:29,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67707449] [2021-11-25 18:04:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:29,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:04:29,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:04:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:04:29,466 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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) [2021-11-25 18:04:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:29,487 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-25 18:04:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:04:29,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 10 [2021-11-25 18:04:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:29,489 INFO L225 Difference]: With dead ends: 23 [2021-11-25 18:04:29,490 INFO L226 Difference]: Without dead ends: 23 [2021-11-25 18:04:29,490 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:04:29,491 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:29,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:04:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-25 18:04:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-25 18:04:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 22 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) [2021-11-25 18:04:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-11-25 18:04:29,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 10 [2021-11-25 18:04:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:29,506 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-11-25 18:04:29,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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) [2021-11-25 18:04:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2021-11-25 18:04:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:04:29,507 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:29,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:29,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 18:04:29,508 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash -725463175, now seen corresponding path program 1 times [2021-11-25 18:04:29,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102984289] [2021-11-25 18:04:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:29,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:04:29,608 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:29,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102984289] [2021-11-25 18:04:29,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102984289] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:29,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063021800] [2021-11-25 18:04:29,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:29,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:29,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:29,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:04:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:29,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:04:29,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:29,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:29,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063021800] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:29,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [765306399] [2021-11-25 18:04:29,799 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-11-25 18:04:29,799 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:29,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:29,800 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:29,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:29,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:29,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:29,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:30,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:30,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:30,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:30,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:30,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:30,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:30,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:30,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:30,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:30,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:30,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:30,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:30,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:30,911 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:30,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:04:30,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:31,016 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:31,376 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '624#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:31,377 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:31,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:31,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2021-11-25 18:04:31,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652867951] [2021-11-25 18:04:31,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:31,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:04:31,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:31,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:04:31,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:04:31,378 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:31,565 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-11-25 18:04:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:04:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-25 18:04:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:31,567 INFO L225 Difference]: With dead ends: 35 [2021-11-25 18:04:31,567 INFO L226 Difference]: Without dead ends: 35 [2021-11-25 18:04:31,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:04:31,568 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:31,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 6 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-25 18:04:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2021-11-25 18:04:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 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) [2021-11-25 18:04:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-25 18:04:31,572 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2021-11-25 18:04:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:31,572 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-25 18:04:31,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-25 18:04:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:04:31,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:31,573 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:31,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:31,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:31,774 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1174809817, now seen corresponding path program 1 times [2021-11-25 18:04:31,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208905440] [2021-11-25 18:04:31,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:31,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:04:31,834 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:31,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208905440] [2021-11-25 18:04:31,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208905440] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:31,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497650031] [2021-11-25 18:04:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:31,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:31,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:31,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:31,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:04:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:31,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:04:31,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:04:32,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:04:32,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497650031] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:32,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:04:32,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2021-11-25 18:04:32,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961091435] [2021-11-25 18:04:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:32,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:04:32,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:04:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:04:32,104 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-25 18:04:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:32,108 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-25 18:04:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:04:32,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 18:04:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:32,110 INFO L225 Difference]: With dead ends: 31 [2021-11-25 18:04:32,110 INFO L226 Difference]: Without dead ends: 30 [2021-11-25 18:04:32,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:04:32,111 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:32,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2021-11-25 18:04:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-25 18:04:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-25 18:04:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 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) [2021-11-25 18:04:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-11-25 18:04:32,115 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2021-11-25 18:04:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:32,115 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-11-25 18:04:32,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-25 18:04:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-11-25 18:04:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:04:32,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:32,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:32,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:32,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:32,335 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2059371235, now seen corresponding path program 1 times [2021-11-25 18:04:32,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:32,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824801006] [2021-11-25 18:04:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:32,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:04:32,403 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:32,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824801006] [2021-11-25 18:04:32,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824801006] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:32,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346380204] [2021-11-25 18:04:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:32,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:32,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:32,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:32,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:04:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:32,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:04:32,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:32,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:32,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:04:32,658 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:04:32,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-11-25 18:04:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:32,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:32,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-11-25 18:04:32,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-11-25 18:04:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:32,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346380204] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [942615124] [2021-11-25 18:04:32,895 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-25 18:04:32,895 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:32,895 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:32,896 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:32,896 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:32,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:32,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:32,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:33,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:33,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:33,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:33,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:33,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:33,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:33,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:33,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:33,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:33,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:33,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:33,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:33,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:33,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:33,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:33,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:34,050 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:04:34,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:34,069 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:34,626 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '927#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (exists ((|v_ULTIMATE.start_main_~#mask~0#1.base_20| Int)) (and (<= 0 |v_ULTIMATE.start_main_~#mask~0#1.base_20|) (= (select |#valid| |v_ULTIMATE.start_main_~#mask~0#1.base_20|) 0))) (<= 32 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:34,627 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:34,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:34,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2021-11-25 18:04:34,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144836878] [2021-11-25 18:04:34,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:34,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:04:34,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:34,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:04:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:04:34,629 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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) [2021-11-25 18:04:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:34,821 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-11-25 18:04:34,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:04:34,822 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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 16 [2021-11-25 18:04:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:34,823 INFO L225 Difference]: With dead ends: 49 [2021-11-25 18:04:34,823 INFO L226 Difference]: Without dead ends: 49 [2021-11-25 18:04:34,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:04:34,824 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:34,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 33 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:04:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-25 18:04:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2021-11-25 18:04:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 31 states have internal predecessors, (36), 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) [2021-11-25 18:04:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-11-25 18:04:34,828 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2021-11-25 18:04:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:34,828 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-11-25 18:04:34,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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) [2021-11-25 18:04:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-11-25 18:04:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:04:34,829 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:34,829 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2021-11-25 18:04:34,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:35,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:35,030 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash -118300012, now seen corresponding path program 1 times [2021-11-25 18:04:35,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:35,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499800082] [2021-11-25 18:04:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:35,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:04:35,098 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:35,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499800082] [2021-11-25 18:04:35,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499800082] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:35,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803456232] [2021-11-25 18:04:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:35,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:35,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:35,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:35,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:04:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:35,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:04:35,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:04:35,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:04:35,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803456232] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806363519] [2021-11-25 18:04:35,247 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:04:35,247 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:35,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:35,248 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:35,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:35,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:35,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:35,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:35,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:35,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:35,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:35,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:35,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:35,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:35,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:35,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:35,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:35,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:35,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:35,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:35,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:36,041 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:36,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:04:36,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:36,117 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:36,425 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1117#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:36,425 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:36,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:36,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-11-25 18:04:36,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490208910] [2021-11-25 18:04:36,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:36,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:04:36,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:36,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:04:36,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:04:36,427 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:36,503 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2021-11-25 18:04:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:04:36,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-25 18:04:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:36,506 INFO L225 Difference]: With dead ends: 76 [2021-11-25 18:04:36,506 INFO L226 Difference]: Without dead ends: 76 [2021-11-25 18:04:36,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:04:36,507 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:36,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-25 18:04:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 39. [2021-11-25 18:04:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 38 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) [2021-11-25 18:04:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2021-11-25 18:04:36,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 16 [2021-11-25 18:04:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:36,512 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2021-11-25 18:04:36,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-11-25 18:04:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:04:36,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:36,513 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1] [2021-11-25 18:04:36,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:36,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 18:04:36,724 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1892594115, now seen corresponding path program 1 times [2021-11-25 18:04:36,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:36,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961613357] [2021-11-25 18:04:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:36,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:04:36,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:36,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961613357] [2021-11-25 18:04:36,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961613357] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:36,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908259999] [2021-11-25 18:04:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:36,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:36,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:36,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:36,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:04:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:36,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:04:36,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:04:37,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:04:37,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908259999] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:37,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378121827] [2021-11-25 18:04:37,056 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:04:37,056 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:37,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:37,057 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:37,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:37,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:37,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:37,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:37,243 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:37,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:04:37,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:37,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:37,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:37,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:37,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:37,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:37,653 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:37,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:04:37,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:37,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:37,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:37,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:37,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:37,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:37,923 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:38,298 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1361#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (< |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647) (= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_#res#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:38,298 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:38,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:38,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-25 18:04:38,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685924787] [2021-11-25 18:04:38,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:38,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:04:38,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:04:38,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:04:38,300 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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) [2021-11-25 18:04:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:38,501 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-11-25 18:04:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:04:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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) Word has length 19 [2021-11-25 18:04:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:38,503 INFO L225 Difference]: With dead ends: 39 [2021-11-25 18:04:38,503 INFO L226 Difference]: Without dead ends: 39 [2021-11-25 18:04:38,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:04:38,504 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:38,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 6 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-25 18:04:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-11-25 18:04:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2571428571428571) 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) [2021-11-25 18:04:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-11-25 18:04:38,508 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 19 [2021-11-25 18:04:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:38,508 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-11-25 18:04:38,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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) [2021-11-25 18:04:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-11-25 18:04:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:04:38,510 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:38,510 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1] [2021-11-25 18:04:38,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:38,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 18:04:38,724 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:38,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2119785853, now seen corresponding path program 2 times [2021-11-25 18:04:38,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:38,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641353440] [2021-11-25 18:04:38,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:38,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-25 18:04:38,875 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641353440] [2021-11-25 18:04:38,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641353440] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226494448] [2021-11-25 18:04:38,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:04:38,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:38,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:38,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:04:38,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:04:38,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:38,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-25 18:04:38,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:38,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:38,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:38,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:04:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-25 18:04:39,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:04:39,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226494448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:39,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:04:39,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2021-11-25 18:04:39,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054635022] [2021-11-25 18:04:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:39,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:04:39,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:04:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:04:39,238 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2021-11-25 18:04:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:39,306 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-11-25 18:04:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:04:39,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 22 [2021-11-25 18:04:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:39,308 INFO L225 Difference]: With dead ends: 38 [2021-11-25 18:04:39,308 INFO L226 Difference]: Without dead ends: 38 [2021-11-25 18:04:39,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:04:39,309 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 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 [2021-11-25 18:04:39,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-25 18:04:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-25 18:04:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 37 states have internal predecessors, (43), 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) [2021-11-25 18:04:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-11-25 18:04:39,313 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2021-11-25 18:04:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:39,313 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-11-25 18:04:39,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2021-11-25 18:04:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-11-25 18:04:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 18:04:39,315 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:39,315 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1] [2021-11-25 18:04:39,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-25 18:04:39,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:39,528 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1696599596, now seen corresponding path program 2 times [2021-11-25 18:04:39,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:39,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728540857] [2021-11-25 18:04:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:39,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 18:04:39,634 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:39,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728540857] [2021-11-25 18:04:39,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728540857] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:39,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128859936] [2021-11-25 18:04:39,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:04:39,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:39,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:39,636 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:39,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:04:39,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:04:39,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:39,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:04:39,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-25 18:04:39,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-25 18:04:39,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128859936] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:39,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270605710] [2021-11-25 18:04:39,974 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:04:39,975 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:39,975 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:39,975 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:39,975 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:39,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:39,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:40,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:40,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:40,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:40,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:40,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:40,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:40,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:40,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:40,782 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:41,086 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1770#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:41,086 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:41,086 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:41,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2021-11-25 18:04:41,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136714648] [2021-11-25 18:04:41,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:41,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:04:41,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:41,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:04:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:04:41,088 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2021-11-25 18:04:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:41,764 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2021-11-25 18:04:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 18:04:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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 [2021-11-25 18:04:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:41,766 INFO L225 Difference]: With dead ends: 159 [2021-11-25 18:04:41,766 INFO L226 Difference]: Without dead ends: 159 [2021-11-25 18:04:41,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=645, Invalid=2217, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 18:04:41,769 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 460 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:41,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 21 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:04:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-25 18:04:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 72. [2021-11-25 18:04:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2021-11-25 18:04:41,774 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 25 [2021-11-25 18:04:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:41,775 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2021-11-25 18:04:41,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2021-11-25 18:04:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2021-11-25 18:04:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 18:04:41,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:41,781 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-11-25 18:04:41,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-25 18:04:41,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 18:04:41,995 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash -934045657, now seen corresponding path program 1 times [2021-11-25 18:04:41,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:41,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255820253] [2021-11-25 18:04:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:41,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-25 18:04:42,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:42,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255820253] [2021-11-25 18:04:42,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255820253] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:42,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168864010] [2021-11-25 18:04:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:42,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:42,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:42,059 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:42,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:04:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:42,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:04:42,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-25 18:04:42,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:42,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-11-25 18:04:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-25 18:04:42,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168864010] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:42,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [463322892] [2021-11-25 18:04:42,606 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:04:42,607 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:42,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:42,607 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:42,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:42,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:42,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:42,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:42,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:42,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:42,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:42,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:42,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:43,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:43,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:43,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:43,171 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:43,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:04:43,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:43,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:43,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:43,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:43,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:43,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:43,498 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:43,876 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2242#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (< (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 32) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:43,877 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:43,877 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:43,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2021-11-25 18:04:43,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663865388] [2021-11-25 18:04:43,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:43,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:04:43,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:43,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:04:43,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:04:43,879 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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) [2021-11-25 18:04:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:44,062 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2021-11-25 18:04:44,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:04:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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 [2021-11-25 18:04:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:44,064 INFO L225 Difference]: With dead ends: 82 [2021-11-25 18:04:44,064 INFO L226 Difference]: Without dead ends: 82 [2021-11-25 18:04:44,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:04:44,066 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 92 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:44,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 39 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-25 18:04:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2021-11-25 18:04:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 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) [2021-11-25 18:04:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-11-25 18:04:44,070 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2021-11-25 18:04:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:44,071 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-11-25 18:04:44,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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) [2021-11-25 18:04:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-11-25 18:04:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-25 18:04:44,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:44,073 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-11-25 18:04:44,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:44,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 18:04:44,295 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1860620851, now seen corresponding path program 1 times [2021-11-25 18:04:44,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:44,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782130386] [2021-11-25 18:04:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:44,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 97 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-25 18:04:44,389 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:44,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782130386] [2021-11-25 18:04:44,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782130386] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:44,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445048084] [2021-11-25 18:04:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:44,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:44,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:44,391 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:44,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 18:04:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:44,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:04:44,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 33 proven. 70 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-25 18:04:44,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 33 proven. 70 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-25 18:04:44,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445048084] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:44,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1242607257] [2021-11-25 18:04:44,771 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-25 18:04:44,771 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:44,771 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:44,772 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:44,772 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:44,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:44,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:44,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:44,954 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:44,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:04:45,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:45,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:45,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:45,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:45,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:45,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:45,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:45,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,755 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:04:45,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:45,776 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:46,190 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2676#(and (exists ((|v_ULTIMATE.start_main_~#b~0#1.base_29| Int)) (and (<= (+ (* 4 |ULTIMATE.start_main_~i~1#1|) 4) (select |#length| |v_ULTIMATE.start_main_~#b~0#1.base_29|)) (= (select |#valid| |v_ULTIMATE.start_main_~#b~0#1.base_29|) 0) (not (= (+ |ULTIMATE.start_main_~i~1#1| 1) (select (select |#memory_int| |v_ULTIMATE.start_main_~#b~0#1.base_29|) (* |ULTIMATE.start_main_~i~1#1| 4)))) (<= 0 |v_ULTIMATE.start_main_~#b~0#1.base_29|))) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 (* 4 |ULTIMATE.start_main_~i~1#1|)) (= |#NULL.offset| 0) (< (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 32) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 1) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:46,191 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:46,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:46,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-11-25 18:04:46,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970472806] [2021-11-25 18:04:46,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:46,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:04:46,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:46,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:04:46,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:04:46,193 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 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) [2021-11-25 18:04:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:46,406 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-11-25 18:04:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:04:46,407 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 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 42 [2021-11-25 18:04:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:46,408 INFO L225 Difference]: With dead ends: 88 [2021-11-25 18:04:46,408 INFO L226 Difference]: Without dead ends: 88 [2021-11-25 18:04:46,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:04:46,409 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:46,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 11 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-25 18:04:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-11-25 18:04:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 80 states have internal predecessors, (88), 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) [2021-11-25 18:04:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2021-11-25 18:04:46,414 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 42 [2021-11-25 18:04:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:46,414 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2021-11-25 18:04:46,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 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) [2021-11-25 18:04:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2021-11-25 18:04:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 18:04:46,416 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:46,417 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-11-25 18:04:46,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:46,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 18:04:46,619 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash -868027189, now seen corresponding path program 2 times [2021-11-25 18:04:46,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:46,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189076987] [2021-11-25 18:04:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:46,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-25 18:04:46,702 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189076987] [2021-11-25 18:04:46,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189076987] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:46,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441225638] [2021-11-25 18:04:46,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:04:46,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:46,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:46,704 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:46,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 18:04:46,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 18:04:46,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:46,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:04:46,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-11-25 18:04:47,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:04:47,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441225638] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:47,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:04:47,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2021-11-25 18:04:47,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261772244] [2021-11-25 18:04:47,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:47,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:04:47,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:47,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:04:47,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:04:47,222 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-11-25 18:04:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:47,225 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-11-25 18:04:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:04:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 45 [2021-11-25 18:04:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:47,227 INFO L225 Difference]: With dead ends: 82 [2021-11-25 18:04:47,227 INFO L226 Difference]: Without dead ends: 81 [2021-11-25 18:04:47,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:04:47,229 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:47,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2021-11-25 18:04:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-25 18:04:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-11-25 18:04:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 80 states have internal predecessors, (86), 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) [2021-11-25 18:04:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2021-11-25 18:04:47,241 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 45 [2021-11-25 18:04:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:47,241 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2021-11-25 18:04:47,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-11-25 18:04:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2021-11-25 18:04:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-25 18:04:47,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:47,249 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2021-11-25 18:04:47,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:47,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 18:04:47,463 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1139034783, now seen corresponding path program 2 times [2021-11-25 18:04:47,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:47,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592375958] [2021-11-25 18:04:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:47,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-25 18:04:47,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:47,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592375958] [2021-11-25 18:04:47,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592375958] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:47,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548901598] [2021-11-25 18:04:47,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:04:47,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:47,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:47,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 18:04:47,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:04:47,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:47,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 18:04:47,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:47,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:47,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:47,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:04:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-11-25 18:04:47,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:04:47,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548901598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:47,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:04:47,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2021-11-25 18:04:47,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731964453] [2021-11-25 18:04:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:47,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:04:47,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:04:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:04:47,996 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:48,036 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2021-11-25 18:04:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:04:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-25 18:04:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:48,038 INFO L225 Difference]: With dead ends: 80 [2021-11-25 18:04:48,038 INFO L226 Difference]: Without dead ends: 80 [2021-11-25 18:04:48,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:04:48,039 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:48,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 9 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:04:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-25 18:04:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-11-25 18:04:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 79 states have internal predecessors, (85), 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) [2021-11-25 18:04:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-11-25 18:04:48,042 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 46 [2021-11-25 18:04:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:48,042 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-11-25 18:04:48,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-11-25 18:04:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-25 18:04:48,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:48,043 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2021-11-25 18:04:48,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:48,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:48,244 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:48,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1551404259, now seen corresponding path program 2 times [2021-11-25 18:04:48,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:48,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914341096] [2021-11-25 18:04:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:48,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-25 18:04:48,333 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:48,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914341096] [2021-11-25 18:04:48,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914341096] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:48,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665012958] [2021-11-25 18:04:48,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:04:48,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:48,336 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:48,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 18:04:48,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 18:04:48,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:48,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:04:48,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2021-11-25 18:04:48,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:04:48,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665012958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:04:48,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:04:48,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2021-11-25 18:04:48,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971210459] [2021-11-25 18:04:48,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:04:48,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:04:48,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:48,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:04:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:04:48,826 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-11-25 18:04:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:48,831 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2021-11-25 18:04:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:04:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 49 [2021-11-25 18:04:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:48,833 INFO L225 Difference]: With dead ends: 79 [2021-11-25 18:04:48,833 INFO L226 Difference]: Without dead ends: 68 [2021-11-25 18:04:48,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:04:48,837 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:48,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2021-11-25 18:04:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-25 18:04:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-25 18:04:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-11-25 18:04:48,848 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 49 [2021-11-25 18:04:48,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:48,848 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-11-25 18:04:48,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-11-25 18:04:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-11-25 18:04:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 18:04:48,851 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:48,851 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 5, 4, 4, 1, 1] [2021-11-25 18:04:48,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:49,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:49,080 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -344265536, now seen corresponding path program 3 times [2021-11-25 18:04:49,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:49,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566094605] [2021-11-25 18:04:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:49,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 257 proven. 214 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-25 18:04:49,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566094605] [2021-11-25 18:04:49,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566094605] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120706705] [2021-11-25 18:04:49,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:04:49,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:49,245 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:49,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 18:04:49,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:04:49,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:49,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:04:49,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 317 proven. 154 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-25 18:04:49,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 317 proven. 154 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-25 18:04:49,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120706705] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:49,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [113548108] [2021-11-25 18:04:49,699 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:04:49,699 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:49,700 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:49,700 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:49,700 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:49,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:49,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:49,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:49,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:49,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:49,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:49,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:50,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:50,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:50,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:50,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:50,226 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:50,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:04:50,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:50,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:50,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:50,431 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:50,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:04:50,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:50,506 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:50,775 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4195#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:50,775 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:50,775 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:50,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2021-11-25 18:04:50,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577376592] [2021-11-25 18:04:50,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:50,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:04:50,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:04:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:04:50,778 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:51,089 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2021-11-25 18:04:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:04:51,090 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-25 18:04:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:51,091 INFO L225 Difference]: With dead ends: 78 [2021-11-25 18:04:51,091 INFO L226 Difference]: Without dead ends: 78 [2021-11-25 18:04:51,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1225, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:04:51,094 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:51,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:04:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-25 18:04:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2021-11-25 18:04:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 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) [2021-11-25 18:04:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-11-25 18:04:51,097 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 67 [2021-11-25 18:04:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:51,097 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-11-25 18:04:51,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-11-25 18:04:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 18:04:51,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:51,098 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 18, 5, 4, 4, 1, 1] [2021-11-25 18:04:51,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:51,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:51,307 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash -539164032, now seen corresponding path program 4 times [2021-11-25 18:04:51,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:51,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256301835] [2021-11-25 18:04:51,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:51,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 216 proven. 26 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-11-25 18:04:51,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:51,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256301835] [2021-11-25 18:04:51,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256301835] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:51,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265958923] [2021-11-25 18:04:51,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:04:51,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:51,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:51,480 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:51,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 18:04:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:51,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 18:04:51,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 216 proven. 26 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-11-25 18:04:51,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 216 proven. 26 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-11-25 18:04:51,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265958923] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:51,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131242953] [2021-11-25 18:04:51,869 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:04:51,870 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:51,870 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:51,870 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:51,871 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:51,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:51,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:52,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:52,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:52,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:52,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:52,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:52,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:52,660 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:52,991 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4810#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:52,992 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:52,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:52,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-25 18:04:52,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548169904] [2021-11-25 18:04:52,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:52,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:04:52,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:52,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:04:52,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:04:52,993 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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) [2021-11-25 18:04:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:53,158 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2021-11-25 18:04:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:04:53,160 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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 70 [2021-11-25 18:04:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:53,161 INFO L225 Difference]: With dead ends: 146 [2021-11-25 18:04:53,161 INFO L226 Difference]: Without dead ends: 146 [2021-11-25 18:04:53,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2021-11-25 18:04:53,163 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 57 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:53,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 5 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-25 18:04:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2021-11-25 18:04:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 88 states have internal predecessors, (97), 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) [2021-11-25 18:04:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-11-25 18:04:53,167 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 70 [2021-11-25 18:04:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:53,167 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-11-25 18:04:53,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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) [2021-11-25 18:04:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-11-25 18:04:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-25 18:04:53,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:53,169 INFO L514 BasicCegarLoop]: trace histogram [25, 24, 24, 5, 4, 4, 1, 1] [2021-11-25 18:04:53,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:53,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 18:04:53,369 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 786597760, now seen corresponding path program 5 times [2021-11-25 18:04:53,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:53,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911981168] [2021-11-25 18:04:53,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:53,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 64 proven. 834 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-25 18:04:53,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:53,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911981168] [2021-11-25 18:04:53,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911981168] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:53,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983660875] [2021-11-25 18:04:53,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:04:53,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:53,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:53,543 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:53,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 18:04:53,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-25 18:04:53,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:53,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:04:53,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 509 proven. 216 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2021-11-25 18:04:53,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 490 proven. 235 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2021-11-25 18:04:54,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983660875] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:54,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1484171678] [2021-11-25 18:04:54,378 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:04:54,378 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:54,378 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:54,379 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:54,379 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:54,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:54,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:04:54,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:54,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:54,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:04:54,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:54,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:54,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:54,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:54,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:54,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:54,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:54,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:04:54,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:54,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:04:54,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:04:55,064 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:04:55,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:04:55,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:04:55,121 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:55,463 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5617#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:55,463 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:55,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:55,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2021-11-25 18:04:55,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583394620] [2021-11-25 18:04:55,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:55,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 18:04:55,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 18:04:55,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 18:04:55,473 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 36 states have internal predecessors, (102), 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) [2021-11-25 18:04:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:58,368 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2021-11-25 18:04:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-11-25 18:04:58,369 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 36 states have internal predecessors, (102), 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 88 [2021-11-25 18:04:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:58,370 INFO L225 Difference]: With dead ends: 195 [2021-11-25 18:04:58,370 INFO L226 Difference]: Without dead ends: 195 [2021-11-25 18:04:58,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3231, Invalid=10341, Unknown=0, NotChecked=0, Total=13572 [2021-11-25 18:04:58,377 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 631 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:58,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 0 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:04:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-25 18:04:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 175. [2021-11-25 18:04:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.1206896551724137) internal successors, (195), 174 states have internal predecessors, (195), 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) [2021-11-25 18:04:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2021-11-25 18:04:58,390 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 88 [2021-11-25 18:04:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:58,390 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2021-11-25 18:04:58,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 36 states have internal predecessors, (102), 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) [2021-11-25 18:04:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2021-11-25 18:04:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-25 18:04:58,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:58,399 INFO L514 BasicCegarLoop]: trace histogram [49, 48, 48, 8, 7, 7, 1, 1] [2021-11-25 18:04:58,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:58,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-25 18:04:58,624 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:04:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash -354852524, now seen corresponding path program 6 times [2021-11-25 18:04:58,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:58,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987978732] [2021-11-25 18:04:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:58,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 2393 proven. 613 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2021-11-25 18:04:58,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:58,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987978732] [2021-11-25 18:04:58,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987978732] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:58,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602963771] [2021-11-25 18:04:58,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:04:58,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:58,911 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:58,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 18:04:59,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:04:59,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:59,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-25 18:04:59,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 193 proven. 3314 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2021-11-25 18:04:59,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:05:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 193 proven. 3314 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2021-11-25 18:05:00,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602963771] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:00,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2035329330] [2021-11-25 18:05:00,490 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:05:00,490 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:00,490 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:00,490 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:00,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:00,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:00,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:05:00,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:00,682 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:05:00,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:05:00,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:00,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:00,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:00,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:00,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:00,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:01,061 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:05:01,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:05:01,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:01,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:01,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:01,236 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:05:01,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:05:01,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:01,308 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:01,673 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7197#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:01,673 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:01,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:01,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 20] total 45 [2021-11-25 18:05:01,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336654843] [2021-11-25 18:05:01,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:01,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 18:05:01,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:01,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 18:05:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2264, Unknown=0, NotChecked=0, Total=2652 [2021-11-25 18:05:01,677 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 46 states, 46 states have (on average 3.739130434782609) internal successors, (172), 45 states have internal predecessors, (172), 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) [2021-11-25 18:05:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:05:03,844 INFO L93 Difference]: Finished difference Result 275 states and 294 transitions. [2021-11-25 18:05:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-11-25 18:05:03,845 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.739130434782609) internal successors, (172), 45 states have internal predecessors, (172), 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 169 [2021-11-25 18:05:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:05:03,847 INFO L225 Difference]: With dead ends: 275 [2021-11-25 18:05:03,847 INFO L226 Difference]: Without dead ends: 275 [2021-11-25 18:05:03,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5820 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2799, Invalid=16661, Unknown=0, NotChecked=0, Total=19460 [2021-11-25 18:05:03,854 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 346 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:05:03,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 0 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:05:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-25 18:05:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2021-11-25 18:05:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.0749063670411985) internal successors, (287), 267 states have internal predecessors, (287), 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) [2021-11-25 18:05:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 287 transitions. [2021-11-25 18:05:03,862 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 287 transitions. Word has length 169 [2021-11-25 18:05:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:05:03,862 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 287 transitions. [2021-11-25 18:05:03,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.739130434782609) internal successors, (172), 45 states have internal predecessors, (172), 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) [2021-11-25 18:05:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 287 transitions. [2021-11-25 18:05:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-11-25 18:05:03,866 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:05:03,867 INFO L514 BasicCegarLoop]: trace histogram [71, 70, 70, 11, 10, 10, 1, 1] [2021-11-25 18:05:03,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 18:05:04,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-25 18:05:04,087 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:05:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:05:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash 847639632, now seen corresponding path program 7 times [2021-11-25 18:05:04,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:05:04,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445085838] [2021-11-25 18:05:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:05:04,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:05:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8240 backedges. 5044 proven. 913 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2021-11-25 18:05:04,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:05:04,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445085838] [2021-11-25 18:05:04,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445085838] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:05:04,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527695671] [2021-11-25 18:05:04,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:05:04,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:05:04,477 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:05:04,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 18:05:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:04,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-25 18:05:04,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:05:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8240 backedges. 5245 proven. 712 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2021-11-25 18:05:05,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:05:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8240 backedges. 5245 proven. 712 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2021-11-25 18:05:05,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527695671] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:05,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342077203] [2021-11-25 18:05:05,851 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:05:05,852 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:05,852 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:05,852 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:05,852 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:05,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:05,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:05:05,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:06,069 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:05:06,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:05:06,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:06,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:06,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:06,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:06,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:06,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:06,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:06,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:05:06,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:06,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:06,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:06,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:06,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:05:06,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:06,654 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:06,930 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9407#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:06,930 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:06,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:06,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 26 [2021-11-25 18:05:06,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138393411] [2021-11-25 18:05:06,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:06,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 18:05:06,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 18:05:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:05:06,932 INFO L87 Difference]: Start difference. First operand 268 states and 287 transitions. Second operand has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 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) [2021-11-25 18:05:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:05:07,526 INFO L93 Difference]: Finished difference Result 268 states and 282 transitions. [2021-11-25 18:05:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-25 18:05:07,526 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 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) Word has length 244 [2021-11-25 18:05:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:05:07,528 INFO L225 Difference]: With dead ends: 268 [2021-11-25 18:05:07,528 INFO L226 Difference]: Without dead ends: 268 [2021-11-25 18:05:07,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1041, Invalid=3651, Unknown=0, NotChecked=0, Total=4692 [2021-11-25 18:05:07,531 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:05:07,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:05:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-25 18:05:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-11-25 18:05:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.0561797752808988) internal successors, (282), 267 states have internal predecessors, (282), 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) [2021-11-25 18:05:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 282 transitions. [2021-11-25 18:05:07,540 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 282 transitions. Word has length 244 [2021-11-25 18:05:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:05:07,540 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 282 transitions. [2021-11-25 18:05:07,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 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) [2021-11-25 18:05:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 282 transitions. [2021-11-25 18:05:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-25 18:05:07,544 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:05:07,544 INFO L514 BasicCegarLoop]: trace histogram [74, 73, 73, 11, 10, 10, 1, 1] [2021-11-25 18:05:07,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 18:05:07,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:07,759 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:05:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:05:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 11748416, now seen corresponding path program 8 times [2021-11-25 18:05:07,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:05:07,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340686445] [2021-11-25 18:05:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:05:07,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:05:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8915 backedges. 5902 proven. 1292 refuted. 0 times theorem prover too weak. 1721 trivial. 0 not checked. [2021-11-25 18:05:08,151 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:05:08,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340686445] [2021-11-25 18:05:08,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340686445] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:05:08,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500608710] [2021-11-25 18:05:08,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:05:08,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:08,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:05:08,156 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:05:08,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 18:05:08,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-25 18:05:08,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:05:08,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-25 18:05:08,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:05:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8915 backedges. 2126 proven. 155 refuted. 0 times theorem prover too weak. 6634 trivial. 0 not checked. [2021-11-25 18:05:08,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:05:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8915 backedges. 2126 proven. 155 refuted. 0 times theorem prover too weak. 6634 trivial. 0 not checked. [2021-11-25 18:05:09,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500608710] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:09,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [940248503] [2021-11-25 18:05:09,504 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:05:09,504 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:09,504 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:09,505 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:09,505 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:09,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:09,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:05:09,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:09,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:09,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:05:09,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:09,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:09,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:09,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:09,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:09,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:09,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:10,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:10,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:10,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:10,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:10,178 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:10,826 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11576#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:10,826 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:10,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:10,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2021-11-25 18:05:10,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766352118] [2021-11-25 18:05:10,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:10,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-25 18:05:10,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-25 18:05:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 18:05:10,829 INFO L87 Difference]: Start difference. First operand 268 states and 282 transitions. Second operand has 43 states, 43 states have (on average 3.4651162790697674) internal successors, (149), 43 states have internal predecessors, (149), 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) [2021-11-25 18:05:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:05:13,234 INFO L93 Difference]: Finished difference Result 354 states and 383 transitions. [2021-11-25 18:05:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-11-25 18:05:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.4651162790697674) internal successors, (149), 43 states have internal predecessors, (149), 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 253 [2021-11-25 18:05:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:05:13,236 INFO L225 Difference]: With dead ends: 354 [2021-11-25 18:05:13,237 INFO L226 Difference]: Without dead ends: 354 [2021-11-25 18:05:13,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4863 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3663, Invalid=14159, Unknown=0, NotChecked=0, Total=17822 [2021-11-25 18:05:13,241 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:05:13,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:05:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-25 18:05:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 299. [2021-11-25 18:05:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.0671140939597314) internal successors, (318), 298 states have internal predecessors, (318), 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) [2021-11-25 18:05:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 318 transitions. [2021-11-25 18:05:13,249 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 318 transitions. Word has length 253 [2021-11-25 18:05:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:05:13,250 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 318 transitions. [2021-11-25 18:05:13,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.4651162790697674) internal successors, (149), 43 states have internal predecessors, (149), 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) [2021-11-25 18:05:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 318 transitions. [2021-11-25 18:05:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-11-25 18:05:13,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:05:13,255 INFO L514 BasicCegarLoop]: trace histogram [88, 87, 87, 11, 10, 10, 1, 1] [2021-11-25 18:05:13,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 18:05:13,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:13,483 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:05:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:05:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1970660376, now seen corresponding path program 9 times [2021-11-25 18:05:13,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:05:13,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093846740] [2021-11-25 18:05:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:05:13,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:05:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12422 backedges. 8471 proven. 1759 refuted. 0 times theorem prover too weak. 2192 trivial. 0 not checked. [2021-11-25 18:05:13,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:05:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093846740] [2021-11-25 18:05:13,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093846740] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:05:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3339779] [2021-11-25 18:05:13,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:05:13,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:05:13,900 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:05:13,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 18:05:14,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:05:14,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:05:14,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-25 18:05:14,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:05:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12422 backedges. 8801 proven. 1429 refuted. 0 times theorem prover too weak. 2192 trivial. 0 not checked. [2021-11-25 18:05:15,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:05:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12422 backedges. 8801 proven. 1429 refuted. 0 times theorem prover too weak. 2192 trivial. 0 not checked. [2021-11-25 18:05:15,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3339779] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:15,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159762803] [2021-11-25 18:05:15,855 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:05:15,855 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:15,856 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:15,856 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:15,856 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:15,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:05:15,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:16,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:05:16,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:16,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:16,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:16,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:16,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:16,599 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:17,106 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14203#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:17,106 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:17,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:17,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 32 [2021-11-25 18:05:17,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015674052] [2021-11-25 18:05:17,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:17,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:05:17,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:05:17,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:05:17,130 INFO L87 Difference]: Start difference. First operand 299 states and 318 transitions. Second operand has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 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) [2021-11-25 18:05:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:05:18,227 INFO L93 Difference]: Finished difference Result 299 states and 315 transitions. [2021-11-25 18:05:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-25 18:05:18,227 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 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 295 [2021-11-25 18:05:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:05:18,229 INFO L225 Difference]: With dead ends: 299 [2021-11-25 18:05:18,229 INFO L226 Difference]: Without dead ends: 299 [2021-11-25 18:05:18,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2581 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2046, Invalid=6696, Unknown=0, NotChecked=0, Total=8742 [2021-11-25 18:05:18,231 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:05:18,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:05:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-25 18:05:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-11-25 18:05:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.0570469798657718) internal successors, (315), 298 states have internal predecessors, (315), 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) [2021-11-25 18:05:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 315 transitions. [2021-11-25 18:05:18,239 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 315 transitions. Word has length 295 [2021-11-25 18:05:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:05:18,240 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 315 transitions. [2021-11-25 18:05:18,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 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) [2021-11-25 18:05:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 315 transitions. [2021-11-25 18:05:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-11-25 18:05:18,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:05:18,245 INFO L514 BasicCegarLoop]: trace histogram [89, 88, 88, 11, 10, 10, 1, 1] [2021-11-25 18:05:18,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 18:05:18,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 18:05:18,471 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:05:18,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:05:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 47435008, now seen corresponding path program 10 times [2021-11-25 18:05:18,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:05:18,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63148489] [2021-11-25 18:05:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:05:18,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:05:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12695 backedges. 5019 proven. 6322 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2021-11-25 18:05:18,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:05:18,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63148489] [2021-11-25 18:05:18,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63148489] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:05:18,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720237578] [2021-11-25 18:05:18,966 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:05:18,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:18,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:05:18,971 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:05:18,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 18:05:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:19,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 18:05:19,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:05:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12695 backedges. 5050 proven. 6291 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2021-11-25 18:05:20,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:05:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12695 backedges. 5050 proven. 6291 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2021-11-25 18:05:20,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720237578] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889771690] [2021-11-25 18:05:20,704 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:05:20,704 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:20,704 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:20,705 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:20,705 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:20,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:20,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:05:20,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:20,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:20,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:05:20,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:20,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:21,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:21,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:21,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:21,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:21,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:05:21,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:21,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:21,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:21,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:05:21,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:21,428 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:21,770 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16737#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:21,770 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:21,770 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:21,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 37 [2021-11-25 18:05:21,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730689715] [2021-11-25 18:05:21,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:21,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 18:05:21,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:21,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 18:05:21,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:05:21,772 INFO L87 Difference]: Start difference. First operand 299 states and 315 transitions. Second operand has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 37 states have internal predecessors, (143), 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) [2021-11-25 18:05:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:05:23,480 INFO L93 Difference]: Finished difference Result 339 states and 356 transitions. [2021-11-25 18:05:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-11-25 18:05:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 37 states have internal predecessors, (143), 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 298 [2021-11-25 18:05:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:05:23,484 INFO L225 Difference]: With dead ends: 339 [2021-11-25 18:05:23,484 INFO L226 Difference]: Without dead ends: 339 [2021-11-25 18:05:23,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 872 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5639 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3304, Invalid=13208, Unknown=0, NotChecked=0, Total=16512 [2021-11-25 18:05:23,487 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 101 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:05:23,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 5 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:05:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-11-25 18:05:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2021-11-25 18:05:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.0538922155688624) internal successors, (352), 334 states have internal predecessors, (352), 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) [2021-11-25 18:05:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 352 transitions. [2021-11-25 18:05:23,496 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 352 transitions. Word has length 298 [2021-11-25 18:05:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:05:23,497 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 352 transitions. [2021-11-25 18:05:23,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 37 states have internal predecessors, (143), 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) [2021-11-25 18:05:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 352 transitions. [2021-11-25 18:05:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2021-11-25 18:05:23,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:05:23,500 INFO L514 BasicCegarLoop]: trace histogram [99, 98, 98, 12, 11, 11, 1, 1] [2021-11-25 18:05:23,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 18:05:23,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 18:05:23,715 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:05:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:05:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash -806450604, now seen corresponding path program 11 times [2021-11-25 18:05:23,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:05:23,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276449305] [2021-11-25 18:05:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:05:23,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:05:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15720 backedges. 11060 proven. 2323 refuted. 0 times theorem prover too weak. 2337 trivial. 0 not checked. [2021-11-25 18:05:24,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:05:24,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276449305] [2021-11-25 18:05:24,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276449305] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:05:24,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062854698] [2021-11-25 18:05:24,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:05:24,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:24,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:05:24,133 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:05:24,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 18:05:24,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-25 18:05:24,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:05:24,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 18:05:24,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:05:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15720 backedges. 7144 proven. 1071 refuted. 0 times theorem prover too weak. 7505 trivial. 0 not checked. [2021-11-25 18:05:25,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:05:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15720 backedges. 7101 proven. 1114 refuted. 0 times theorem prover too weak. 7505 trivial. 0 not checked. [2021-11-25 18:05:26,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062854698] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:26,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650611499] [2021-11-25 18:05:26,511 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:05:26,512 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:26,512 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:26,512 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:26,512 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:26,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:26,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:05:26,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:26,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:26,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:05:26,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:26,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:26,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:26,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:26,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:26,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:27,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:27,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:05:27,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:27,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:27,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:27,220 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:05:27,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:05:27,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:27,291 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:27,696 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '19628#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:27,696 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:27,696 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:27,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 61 [2021-11-25 18:05:27,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136530972] [2021-11-25 18:05:27,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:27,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-11-25 18:05:27,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:27,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-25 18:05:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=3711, Unknown=0, NotChecked=0, Total=4422 [2021-11-25 18:05:27,700 INFO L87 Difference]: Start difference. First operand 335 states and 352 transitions. Second operand has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 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) [2021-11-25 18:05:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:05:37,983 INFO L93 Difference]: Finished difference Result 581 states and 640 transitions. [2021-11-25 18:05:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2021-11-25 18:05:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 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 331 [2021-11-25 18:05:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:05:37,987 INFO L225 Difference]: With dead ends: 581 [2021-11-25 18:05:37,988 INFO L226 Difference]: Without dead ends: 581 [2021-11-25 18:05:37,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1234 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27370 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15636, Invalid=64736, Unknown=0, NotChecked=0, Total=80372 [2021-11-25 18:05:37,994 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:05:37,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1173 Valid, 0 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 18:05:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-11-25 18:05:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 472. [2021-11-25 18:05:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.089171974522293) internal successors, (513), 471 states have internal predecessors, (513), 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) [2021-11-25 18:05:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 513 transitions. [2021-11-25 18:05:38,007 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 513 transitions. Word has length 331 [2021-11-25 18:05:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:05:38,007 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 513 transitions. [2021-11-25 18:05:38,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 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) [2021-11-25 18:05:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 513 transitions. [2021-11-25 18:05:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-11-25 18:05:38,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:05:38,012 INFO L514 BasicCegarLoop]: trace histogram [140, 139, 139, 14, 13, 13, 1, 1] [2021-11-25 18:05:38,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 18:05:38,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 18:05:38,239 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:05:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:05:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash -211260100, now seen corresponding path program 12 times [2021-11-25 18:05:38,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:05:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076473817] [2021-11-25 18:05:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:05:38,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:05:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31118 backedges. 15584 proven. 8879 refuted. 0 times theorem prover too weak. 6655 trivial. 0 not checked. [2021-11-25 18:05:38,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:05:38,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076473817] [2021-11-25 18:05:38,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076473817] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:05:38,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962022689] [2021-11-25 18:05:38,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:05:38,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:38,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:05:38,852 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:05:38,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 18:05:40,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:05:40,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:05:40,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 2137 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-25 18:05:40,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:05:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 31118 backedges. 9498 proven. 19596 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2021-11-25 18:05:42,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:05:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31118 backedges. 9498 proven. 19596 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2021-11-25 18:05:43,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962022689] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1516137643] [2021-11-25 18:05:43,698 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:05:43,699 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:43,699 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:43,699 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:43,699 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:43,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:43,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:05:43,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:43,860 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:05:43,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:05:43,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:43,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:44,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:44,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:44,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:44,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:44,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:05:44,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:44,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:44,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:05:44,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:44,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:05:44,455 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:45,209 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '23959#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:45,209 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:45,209 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:45,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 40, 40] total 79 [2021-11-25 18:05:45,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568952114] [2021-11-25 18:05:45,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:45,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-11-25 18:05:45,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-11-25 18:05:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1742, Invalid=5568, Unknown=0, NotChecked=0, Total=7310 [2021-11-25 18:05:45,212 INFO L87 Difference]: Start difference. First operand 472 states and 513 transitions. Second operand has 80 states, 80 states have (on average 3.9) internal successors, (312), 79 states have internal predecessors, (312), 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) [2021-11-25 18:05:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:05:58,015 INFO L93 Difference]: Finished difference Result 2735 states and 3082 transitions. [2021-11-25 18:05:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-11-25 18:05:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 3.9) internal successors, (312), 79 states have internal predecessors, (312), 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 460 [2021-11-25 18:05:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:05:58,028 INFO L225 Difference]: With dead ends: 2735 [2021-11-25 18:05:58,028 INFO L226 Difference]: Without dead ends: 2735 [2021-11-25 18:05:58,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1770 GetRequests, 1318 SyntacticMatches, 1 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112226 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=58847, Invalid=145909, Unknown=0, NotChecked=0, Total=204756 [2021-11-25 18:05:58,046 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 167 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:05:58,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 8 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 18:05:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2021-11-25 18:05:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 1369. [2021-11-25 18:05:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.1176900584795322) internal successors, (1529), 1368 states have internal predecessors, (1529), 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) [2021-11-25 18:05:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1529 transitions. [2021-11-25 18:05:58,093 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1529 transitions. Word has length 460 [2021-11-25 18:05:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:05:58,094 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1529 transitions. [2021-11-25 18:05:58,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 3.9) internal successors, (312), 79 states have internal predecessors, (312), 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) [2021-11-25 18:05:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1529 transitions. [2021-11-25 18:05:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2021-11-25 18:05:58,144 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:05:58,145 INFO L514 BasicCegarLoop]: trace histogram [272, 271, 271, 26, 25, 25, 1, 1] [2021-11-25 18:05:58,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 18:05:58,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:58,355 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:05:58,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:05:58,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2035304916, now seen corresponding path program 13 times [2021-11-25 18:05:58,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:05:58,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868417870] [2021-11-25 18:05:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:05:58,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:05:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:05:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 118022 backedges. 54124 proven. 2993 refuted. 0 times theorem prover too weak. 60905 trivial. 0 not checked. [2021-11-25 18:05:59,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:05:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868417870] [2021-11-25 18:05:59,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868417870] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:05:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160673313] [2021-11-25 18:05:59,401 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:05:59,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:05:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:05:59,402 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:05:59,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 18:06:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:06:00,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 4105 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-25 18:06:00,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:06:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 118022 backedges. 54611 proven. 2506 refuted. 0 times theorem prover too weak. 60905 trivial. 0 not checked. [2021-11-25 18:06:01,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:06:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 118022 backedges. 54611 proven. 2506 refuted. 0 times theorem prover too weak. 60905 trivial. 0 not checked. [2021-11-25 18:06:03,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160673313] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:06:03,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [709983275] [2021-11-25 18:06:03,038 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:06:03,039 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:06:03,039 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:06:03,039 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:06:03,039 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:06:03,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:03,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:06:03,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:03,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:06:03,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:03,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:03,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:03,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:06:03,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:03,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:03,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:06:03,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:03,771 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:06:04,093 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '34188#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:06:04,093 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:06:04,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:06:04,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 38 [2021-11-25 18:06:04,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587859438] [2021-11-25 18:06:04,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:06:04,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 18:06:04,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:06:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 18:06:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1583, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:06:04,096 INFO L87 Difference]: Start difference. First operand 1369 states and 1529 transitions. Second operand has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 38 states have internal predecessors, (149), 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) [2021-11-25 18:06:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:06:05,686 INFO L93 Difference]: Finished difference Result 1369 states and 1510 transitions. [2021-11-25 18:06:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-11-25 18:06:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 38 states have internal predecessors, (149), 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 892 [2021-11-25 18:06:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:06:05,695 INFO L225 Difference]: With dead ends: 1369 [2021-11-25 18:06:05,696 INFO L226 Difference]: Without dead ends: 1369 [2021-11-25 18:06:05,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2776 GetRequests, 2655 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4578 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3673, Invalid=11333, Unknown=0, NotChecked=0, Total=15006 [2021-11-25 18:06:05,698 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:06:05,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:06:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2021-11-25 18:06:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2021-11-25 18:06:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.1038011695906433) internal successors, (1510), 1368 states have internal predecessors, (1510), 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) [2021-11-25 18:06:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1510 transitions. [2021-11-25 18:06:05,733 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1510 transitions. Word has length 892 [2021-11-25 18:06:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:06:05,734 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1510 transitions. [2021-11-25 18:06:05,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 38 states have internal predecessors, (149), 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) [2021-11-25 18:06:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1510 transitions. [2021-11-25 18:06:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2021-11-25 18:06:05,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:06:05,776 INFO L514 BasicCegarLoop]: trace histogram [284, 283, 283, 26, 25, 25, 1, 1] [2021-11-25 18:06:05,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 18:06:06,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-25 18:06:06,004 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:06:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:06:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 492508220, now seen corresponding path program 14 times [2021-11-25 18:06:06,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:06:06,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471498649] [2021-11-25 18:06:06,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:06:06,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:06:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:06:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 128300 backedges. 64241 proven. 3778 refuted. 0 times theorem prover too weak. 60281 trivial. 0 not checked. [2021-11-25 18:06:07,184 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:06:07,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471498649] [2021-11-25 18:06:07,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471498649] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:06:07,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498128765] [2021-11-25 18:06:07,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:06:07,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:06:07,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:06:07,185 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:06:07,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 18:06:07,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-25 18:06:07,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:06:07,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 18:06:07,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:06:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 128300 backedges. 43123 proven. 4023 refuted. 0 times theorem prover too weak. 81154 trivial. 0 not checked. [2021-11-25 18:06:09,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:06:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 128300 backedges. 43080 proven. 4066 refuted. 0 times theorem prover too weak. 81154 trivial. 0 not checked. [2021-11-25 18:06:11,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498128765] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:06:11,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [415558776] [2021-11-25 18:06:11,452 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:06:11,452 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:06:11,453 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:06:11,453 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:06:11,453 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:06:11,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:11,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:06:11,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:11,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:11,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:06:11,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:11,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:06:11,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:06:11,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:11,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:11,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:11,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:06:11,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:12,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:12,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:12,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:12,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:12,163 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:06:12,868 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '42719#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:06:12,868 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:06:12,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:06:12,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 69 [2021-11-25 18:06:12,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067601532] [2021-11-25 18:06:12,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:06:12,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-11-25 18:06:12,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:06:12,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-11-25 18:06:12,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=876, Invalid=4674, Unknown=0, NotChecked=0, Total=5550 [2021-11-25 18:06:12,872 INFO L87 Difference]: Start difference. First operand 1369 states and 1510 transitions. Second operand has 69 states, 69 states have (on average 3.347826086956522) internal successors, (231), 69 states have internal predecessors, (231), 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) [2021-11-25 18:06:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:06:30,789 INFO L93 Difference]: Finished difference Result 3825 states and 4261 transitions. [2021-11-25 18:06:30,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2021-11-25 18:06:30,789 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.347826086956522) internal successors, (231), 69 states have internal predecessors, (231), 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 928 [2021-11-25 18:06:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:06:30,808 INFO L225 Difference]: With dead ends: 3825 [2021-11-25 18:06:30,808 INFO L226 Difference]: Without dead ends: 3825 [2021-11-25 18:06:30,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3129 GetRequests, 2741 SyntacticMatches, 0 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56022 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=29108, Invalid=122602, Unknown=0, NotChecked=0, Total=151710 [2021-11-25 18:06:30,821 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2014 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 1222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2014 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:06:30,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2014 Valid, 0 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:06:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2021-11-25 18:06:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 1672. [2021-11-25 18:06:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.1035308198683422) internal successors, (1844), 1671 states have internal predecessors, (1844), 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) [2021-11-25 18:06:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1844 transitions. [2021-11-25 18:06:30,873 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1844 transitions. Word has length 928 [2021-11-25 18:06:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:06:30,874 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 1844 transitions. [2021-11-25 18:06:30,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.347826086956522) internal successors, (231), 69 states have internal predecessors, (231), 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) [2021-11-25 18:06:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1844 transitions. [2021-11-25 18:06:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2021-11-25 18:06:30,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:06:30,889 INFO L514 BasicCegarLoop]: trace histogram [328, 327, 327, 27, 26, 26, 1, 1] [2021-11-25 18:06:30,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 18:06:31,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:06:31,103 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:06:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:06:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1249661560, now seen corresponding path program 15 times [2021-11-25 18:06:31,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:06:31,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79545057] [2021-11-25 18:06:31,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:06:31,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:06:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:06:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 170086 backedges. 85656 proven. 4687 refuted. 0 times theorem prover too weak. 79743 trivial. 0 not checked. [2021-11-25 18:06:32,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:06:32,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79545057] [2021-11-25 18:06:32,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79545057] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:06:32,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263597758] [2021-11-25 18:06:32,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:06:32,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:06:32,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:06:32,495 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:06:32,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 18:06:45,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:06:45,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:06:45,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 4809 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-25 18:06:45,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:06:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 170086 backedges. 121603 proven. 6685 refuted. 0 times theorem prover too weak. 41798 trivial. 0 not checked. [2021-11-25 18:06:47,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:06:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 170086 backedges. 121603 proven. 6685 refuted. 0 times theorem prover too weak. 41798 trivial. 0 not checked. [2021-11-25 18:06:48,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263597758] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:06:48,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748704269] [2021-11-25 18:06:48,963 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:06:48,963 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:06:48,964 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:06:48,964 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:06:48,964 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:06:48,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:48,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:06:49,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:06:49,130 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:06:49,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:06:49,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:49,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:06:49,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:49,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:49,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:49,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:49,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:49,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:06:49,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:49,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:49,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:49,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:49,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:06:49,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:49,711 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:06:50,044 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '55285#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:06:50,044 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:06:50,044 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:06:50,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33, 33] total 54 [2021-11-25 18:06:50,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367607620] [2021-11-25 18:06:50,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:06:50,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-25 18:06:50,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:06:50,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-25 18:06:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=2876, Unknown=0, NotChecked=0, Total=3660 [2021-11-25 18:06:50,087 INFO L87 Difference]: Start difference. First operand 1672 states and 1844 transitions. Second operand has 55 states, 55 states have (on average 4.254545454545455) internal successors, (234), 54 states have internal predecessors, (234), 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) [2021-11-25 18:06:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:06:53,631 INFO L93 Difference]: Finished difference Result 1306 states and 1372 transitions. [2021-11-25 18:06:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2021-11-25 18:06:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.254545454545455) internal successors, (234), 54 states have internal predecessors, (234), 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 1063 [2021-11-25 18:06:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:06:53,636 INFO L225 Difference]: With dead ends: 1306 [2021-11-25 18:06:53,637 INFO L226 Difference]: Without dead ends: 1306 [2021-11-25 18:06:53,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3394 GetRequests, 3156 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19697 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=16443, Invalid=40917, Unknown=0, NotChecked=0, Total=57360 [2021-11-25 18:06:53,644 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:06:53,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:06:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2021-11-25 18:06:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2021-11-25 18:06:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1305 states have (on average 1.0513409961685825) internal successors, (1372), 1305 states have internal predecessors, (1372), 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) [2021-11-25 18:06:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1372 transitions. [2021-11-25 18:06:53,669 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1372 transitions. Word has length 1063 [2021-11-25 18:06:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:06:53,670 INFO L470 AbstractCegarLoop]: Abstraction has 1306 states and 1372 transitions. [2021-11-25 18:06:53,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.254545454545455) internal successors, (234), 54 states have internal predecessors, (234), 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) [2021-11-25 18:06:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1372 transitions. [2021-11-25 18:06:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2021-11-25 18:06:53,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:06:53,684 INFO L514 BasicCegarLoop]: trace histogram [372, 371, 371, 27, 26, 26, 1, 1] [2021-11-25 18:06:53,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-11-25 18:06:53,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-25 18:06:53,899 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:06:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:06:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash -177978296, now seen corresponding path program 16 times [2021-11-25 18:06:53,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:06:53,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721366112] [2021-11-25 18:06:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:06:53,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:06:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:06:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 217320 backedges. 110712 proven. 5729 refuted. 0 times theorem prover too weak. 100879 trivial. 0 not checked. [2021-11-25 18:06:55,213 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:06:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721366112] [2021-11-25 18:06:55,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721366112] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:06:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646581096] [2021-11-25 18:06:55,214 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:06:55,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:06:55,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:06:55,215 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:06:55,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 18:06:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:06:56,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 5337 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-25 18:06:56,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:06:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 217320 backedges. 111487 proven. 4954 refuted. 0 times theorem prover too weak. 100879 trivial. 0 not checked. [2021-11-25 18:06:58,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:06:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 217320 backedges. 111487 proven. 4954 refuted. 0 times theorem prover too weak. 100879 trivial. 0 not checked. [2021-11-25 18:06:59,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646581096] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:06:59,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237092342] [2021-11-25 18:06:59,721 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:06:59,721 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:06:59,721 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:06:59,722 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:06:59,722 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:06:59,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:59,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:06:59,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:59,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:06:59,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:06:59,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:06:59,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:06:59,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:00,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:00,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:07:00,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:00,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:00,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:07:00,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:00,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:07:00,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:07:00,253 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:07:00,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:07:00,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:00,318 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:07:00,704 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '65473#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:07:00,704 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:07:00,704 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:07:00,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 47 [2021-11-25 18:07:00,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545951693] [2021-11-25 18:07:00,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:07:00,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-25 18:07:00,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:07:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-25 18:07:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=2285, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 18:07:00,708 INFO L87 Difference]: Start difference. First operand 1306 states and 1372 transitions. Second operand has 48 states, 48 states have (on average 3.8541666666666665) internal successors, (185), 47 states have internal predecessors, (185), 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) [2021-11-25 18:07:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:07:03,187 INFO L93 Difference]: Finished difference Result 1306 states and 1368 transitions. [2021-11-25 18:07:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-11-25 18:07:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.8541666666666665) internal successors, (185), 47 states have internal predecessors, (185), 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 1195 [2021-11-25 18:07:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:07:03,197 INFO L225 Difference]: With dead ends: 1306 [2021-11-25 18:07:03,197 INFO L226 Difference]: Without dead ends: 1306 [2021-11-25 18:07:03,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3733 GetRequests, 3561 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9631 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=7761, Invalid=22341, Unknown=0, NotChecked=0, Total=30102 [2021-11-25 18:07:03,201 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:07:03,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:07:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2021-11-25 18:07:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2021-11-25 18:07:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1305 states have (on average 1.0482758620689656) internal successors, (1368), 1305 states have internal predecessors, (1368), 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) [2021-11-25 18:07:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1368 transitions. [2021-11-25 18:07:03,223 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1368 transitions. Word has length 1195 [2021-11-25 18:07:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:07:03,224 INFO L470 AbstractCegarLoop]: Abstraction has 1306 states and 1368 transitions. [2021-11-25 18:07:03,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.8541666666666665) internal successors, (185), 47 states have internal predecessors, (185), 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) [2021-11-25 18:07:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1368 transitions. [2021-11-25 18:07:03,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2021-11-25 18:07:03,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:07:03,238 INFO L514 BasicCegarLoop]: trace histogram [376, 375, 375, 27, 26, 26, 1, 1] [2021-11-25 18:07:03,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-11-25 18:07:03,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-25 18:07:03,463 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:07:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:07:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1855894792, now seen corresponding path program 17 times [2021-11-25 18:07:03,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:07:03,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128182741] [2021-11-25 18:07:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:07:03,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:07:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:07:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 221902 backedges. 123099 proven. 6913 refuted. 0 times theorem prover too weak. 91890 trivial. 0 not checked. [2021-11-25 18:07:04,916 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:07:04,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128182741] [2021-11-25 18:07:04,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128182741] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:07:04,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214591877] [2021-11-25 18:07:04,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:07:04,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:07:04,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:07:04,919 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:07:04,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 18:07:05,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-25 18:07:05,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:07:05,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-25 18:07:05,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:07:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 221902 backedges. 24602 proven. 737 refuted. 0 times theorem prover too weak. 196563 trivial. 0 not checked. [2021-11-25 18:07:07,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:07:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 221902 backedges. 24602 proven. 737 refuted. 0 times theorem prover too weak. 196563 trivial. 0 not checked. [2021-11-25 18:07:08,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214591877] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:07:08,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1298787205] [2021-11-25 18:07:08,985 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:07:08,986 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:07:08,986 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:07:08,986 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:07:08,986 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:07:09,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:09,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:07:09,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:07:09,147 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:07:09,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:07:09,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:09,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:07:09,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:07:09,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:09,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:09,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:07:09,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:09,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:09,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:07:09,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:09,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:09,696 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:07:10,362 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '75635#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:07:10,362 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:07:10,362 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:07:10,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 25] total 68 [2021-11-25 18:07:10,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751270177] [2021-11-25 18:07:10,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:07:10,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2021-11-25 18:07:10,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:07:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-11-25 18:07:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=4508, Unknown=0, NotChecked=0, Total=5402 [2021-11-25 18:07:10,365 INFO L87 Difference]: Start difference. First operand 1306 states and 1368 transitions. Second operand has 68 states, 68 states have (on average 3.6323529411764706) internal successors, (247), 68 states have internal predecessors, (247), 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) [2021-11-25 18:07:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:07:16,723 INFO L93 Difference]: Finished difference Result 1413 states and 1479 transitions. [2021-11-25 18:07:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2021-11-25 18:07:16,723 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.6323529411764706) internal successors, (247), 68 states have internal predecessors, (247), 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 1207 [2021-11-25 18:07:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:07:16,728 INFO L225 Difference]: With dead ends: 1413 [2021-11-25 18:07:16,728 INFO L226 Difference]: Without dead ends: 1413 [2021-11-25 18:07:16,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3848 GetRequests, 3579 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21539 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=14476, Invalid=58154, Unknown=0, NotChecked=0, Total=72630 [2021-11-25 18:07:16,733 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 337 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:07:16,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 0 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 18:07:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2021-11-25 18:07:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1319. [2021-11-25 18:07:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.0447647951441579) internal successors, (1377), 1318 states have internal predecessors, (1377), 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) [2021-11-25 18:07:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1377 transitions. [2021-11-25 18:07:16,755 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1377 transitions. Word has length 1207 [2021-11-25 18:07:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:07:16,755 INFO L470 AbstractCegarLoop]: Abstraction has 1319 states and 1377 transitions. [2021-11-25 18:07:16,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.6323529411764706) internal successors, (247), 68 states have internal predecessors, (247), 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) [2021-11-25 18:07:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1377 transitions. [2021-11-25 18:07:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2021-11-25 18:07:16,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:07:16,770 INFO L514 BasicCegarLoop]: trace histogram [389, 388, 388, 27, 26, 26, 1, 1] [2021-11-25 18:07:16,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-25 18:07:16,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-25 18:07:16,983 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:07:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:07:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1052356104, now seen corresponding path program 18 times [2021-11-25 18:07:16,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:07:16,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158327081] [2021-11-25 18:07:16,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:07:16,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:07:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:07:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 237125 backedges. 139795 proven. 8248 refuted. 0 times theorem prover too weak. 89082 trivial. 0 not checked. [2021-11-25 18:07:18,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:07:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158327081] [2021-11-25 18:07:18,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158327081] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:07:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715561568] [2021-11-25 18:07:18,613 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:07:18,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:07:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:07:18,615 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:07:18,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 18:07:50,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:07:50,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:07:50,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 5541 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-25 18:07:50,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:07:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 237125 backedges. 37870 proven. 189792 refuted. 0 times theorem prover too weak. 9463 trivial. 0 not checked. [2021-11-25 18:07:54,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:07:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 237125 backedges. 37870 proven. 189792 refuted. 0 times theorem prover too weak. 9463 trivial. 0 not checked. [2021-11-25 18:07:57,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715561568] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:07:57,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [338779052] [2021-11-25 18:07:57,507 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:07:57,507 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:07:57,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:07:57,507 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:07:57,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:07:57,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:57,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:07:57,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:07:57,651 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:07:57,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:07:57,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:57,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:07:57,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:07:57,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:57,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:57,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:07:57,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:57,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:57,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:07:58,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:07:58,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:58,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:07:58,141 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:07:58,766 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '86353#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:07:58,766 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:07:58,766 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:07:58,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 55, 55] total 116 [2021-11-25 18:07:58,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000676167] [2021-11-25 18:07:58,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:07:58,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2021-11-25 18:07:58,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:07:58,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2021-11-25 18:07:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2039, Invalid=12967, Unknown=0, NotChecked=0, Total=15006 [2021-11-25 18:07:58,772 INFO L87 Difference]: Start difference. First operand 1319 states and 1377 transitions. Second operand has 117 states, 117 states have (on average 3.9743589743589745) internal successors, (465), 116 states have internal predecessors, (465), 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) [2021-11-25 18:08:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:08:18,816 INFO L93 Difference]: Finished difference Result 1560 states and 1631 transitions. [2021-11-25 18:08:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 543 states. [2021-11-25 18:08:18,816 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 3.9743589743589745) internal successors, (465), 116 states have internal predecessors, (465), 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 1246 [2021-11-25 18:08:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:08:18,821 INFO L225 Difference]: With dead ends: 1560 [2021-11-25 18:08:18,821 INFO L226 Difference]: Without dead ends: 1560 [2021-11-25 18:08:18,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4309 GetRequests, 3648 SyntacticMatches, 1 SemanticMatches, 660 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163783 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=41362, Invalid=396220, Unknown=0, NotChecked=0, Total=437582 [2021-11-25 18:08:18,843 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2025 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9369 mSolverCounterSat, 1695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1695 IncrementalHoareTripleChecker+Valid, 9369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:08:18,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2025 Valid, 0 Invalid, 11064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1695 Valid, 9369 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-11-25 18:08:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-11-25 18:08:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1484. [2021-11-25 18:08:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 1.0485502360080916) internal successors, (1555), 1483 states have internal predecessors, (1555), 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) [2021-11-25 18:08:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1555 transitions. [2021-11-25 18:08:18,867 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1555 transitions. Word has length 1246 [2021-11-25 18:08:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:08:18,868 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 1555 transitions. [2021-11-25 18:08:18,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 3.9743589743589745) internal successors, (465), 116 states have internal predecessors, (465), 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) [2021-11-25 18:08:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1555 transitions. [2021-11-25 18:08:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1373 [2021-11-25 18:08:19,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:08:19,019 INFO L514 BasicCegarLoop]: trace histogram [429, 428, 428, 29, 28, 28, 1, 1] [2021-11-25 18:08:19,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 18:08:19,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-25 18:08:19,232 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:08:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:08:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1729657912, now seen corresponding path program 19 times [2021-11-25 18:08:19,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:08:19,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039643704] [2021-11-25 18:08:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:08:19,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:08:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:08:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 288164 backedges. 172023 proven. 9743 refuted. 0 times theorem prover too weak. 106398 trivial. 0 not checked. [2021-11-25 18:08:20,774 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:08:20,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039643704] [2021-11-25 18:08:20,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039643704] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:08:20,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468031484] [2021-11-25 18:08:20,775 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:08:20,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:08:20,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:08:20,779 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:08:20,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 18:08:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:08:22,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 6085 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-25 18:08:22,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:08:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 288164 backedges. 173149 proven. 8617 refuted. 0 times theorem prover too weak. 106398 trivial. 0 not checked. [2021-11-25 18:08:24,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:08:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 288164 backedges. 173149 proven. 8617 refuted. 0 times theorem prover too weak. 106398 trivial. 0 not checked. [2021-11-25 18:08:26,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468031484] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:08:26,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [626617877] [2021-11-25 18:08:26,249 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:08:26,249 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:08:26,249 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:08:26,249 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:08:26,249 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:08:26,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:26,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:08:26,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:08:26,382 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:08:26,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:08:26,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:26,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:08:26,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:08:26,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:26,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:26,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:08:26,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:08:26,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:26,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:26,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:08:26,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:26,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:26,885 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:08:27,464 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '98764#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:08:27,465 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:08:27,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:08:27,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 56 [2021-11-25 18:08:27,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096851390] [2021-11-25 18:08:27,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:08:27,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-25 18:08:27,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:08:27,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-25 18:08:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=3113, Unknown=0, NotChecked=0, Total=3906 [2021-11-25 18:08:27,469 INFO L87 Difference]: Start difference. First operand 1484 states and 1555 transitions. Second operand has 57 states, 57 states have (on average 3.8771929824561404) internal successors, (221), 56 states have internal predecessors, (221), 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) [2021-11-25 18:08:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:08:31,222 INFO L93 Difference]: Finished difference Result 1484 states and 1554 transitions. [2021-11-25 18:08:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-11-25 18:08:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.8771929824561404) internal successors, (221), 56 states have internal predecessors, (221), 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 1372 [2021-11-25 18:08:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:08:31,228 INFO L225 Difference]: With dead ends: 1484 [2021-11-25 18:08:31,228 INFO L226 Difference]: Without dead ends: 1484 [2021-11-25 18:08:31,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4321 GetRequests, 4089 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18203 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=14606, Invalid=39916, Unknown=0, NotChecked=0, Total=54522 [2021-11-25 18:08:31,232 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:08:31,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:08:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2021-11-25 18:08:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2021-11-25 18:08:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 1.047875927174646) internal successors, (1554), 1483 states have internal predecessors, (1554), 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) [2021-11-25 18:08:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1554 transitions. [2021-11-25 18:08:31,254 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1554 transitions. Word has length 1372 [2021-11-25 18:08:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:08:31,255 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 1554 transitions. [2021-11-25 18:08:31,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.8771929824561404) internal successors, (221), 56 states have internal predecessors, (221), 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) [2021-11-25 18:08:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1554 transitions. [2021-11-25 18:08:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1376 [2021-11-25 18:08:31,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:08:31,273 INFO L514 BasicCegarLoop]: trace histogram [430, 429, 429, 29, 28, 28, 1, 1] [2021-11-25 18:08:31,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-25 18:08:31,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:08:31,487 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:08:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:08:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -720956896, now seen corresponding path program 20 times [2021-11-25 18:08:31,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:08:31,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502861512] [2021-11-25 18:08:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:08:31,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:08:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:08:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 289478 backedges. 197124 proven. 13249 refuted. 0 times theorem prover too weak. 79105 trivial. 0 not checked. [2021-11-25 18:08:33,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:08:33,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502861512] [2021-11-25 18:08:33,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502861512] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:08:33,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743792623] [2021-11-25 18:08:33,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:08:33,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:08:33,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:08:33,170 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:08:33,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 18:08:34,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2021-11-25 18:08:34,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:08:34,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-25 18:08:34,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:08:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 289478 backedges. 69319 proven. 3971 refuted. 0 times theorem prover too weak. 216188 trivial. 0 not checked. [2021-11-25 18:08:37,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:08:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 289478 backedges. 69256 proven. 4034 refuted. 0 times theorem prover too weak. 216188 trivial. 0 not checked. [2021-11-25 18:08:40,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743792623] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:08:40,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1911241298] [2021-11-25 18:08:40,748 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:08:40,748 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:08:40,748 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:08:40,748 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:08:40,748 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:08:40,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:40,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:08:40,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:40,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:40,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:08:40,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:40,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:08:41,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:41,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:41,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:08:41,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:08:41,145 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:08:41,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:08:41,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:41,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:08:41,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:41,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:41,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:08:41,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:08:41,410 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:08:41,914 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '110435#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:08:41,914 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:08:41,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:08:41,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 36] total 111 [2021-11-25 18:08:41,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234101427] [2021-11-25 18:08:41,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:08:41,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2021-11-25 18:08:41,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:08:41,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2021-11-25 18:08:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2274, Invalid=11298, Unknown=0, NotChecked=0, Total=13572 [2021-11-25 18:08:41,918 INFO L87 Difference]: Start difference. First operand 1484 states and 1554 transitions. Second operand has 111 states, 111 states have (on average 3.3513513513513513) internal successors, (372), 111 states have internal predecessors, (372), 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) [2021-11-25 18:09:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:09:04,533 INFO L93 Difference]: Finished difference Result 1921 states and 2032 transitions. [2021-11-25 18:09:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 432 states. [2021-11-25 18:09:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 111 states have (on average 3.3513513513513513) internal successors, (372), 111 states have internal predecessors, (372), 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 1375 [2021-11-25 18:09:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:09:04,540 INFO L225 Difference]: With dead ends: 1921 [2021-11-25 18:09:04,540 INFO L226 Difference]: Without dead ends: 1921 [2021-11-25 18:09:04,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4592 GetRequests, 4049 SyntacticMatches, 0 SemanticMatches, 543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98489 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=54063, Invalid=242417, Unknown=0, NotChecked=0, Total=296480 [2021-11-25 18:09:04,551 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2406 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 1157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1157 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:09:04,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2406 Valid, 0 Invalid, 4179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1157 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:09:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2021-11-25 18:09:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1589. [2021-11-25 18:09:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.0472292191435768) internal successors, (1663), 1588 states have internal predecessors, (1663), 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) [2021-11-25 18:09:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1663 transitions. [2021-11-25 18:09:04,571 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1663 transitions. Word has length 1375 [2021-11-25 18:09:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:09:04,572 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 1663 transitions. [2021-11-25 18:09:04,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.3513513513513513) internal successors, (372), 111 states have internal predecessors, (372), 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) [2021-11-25 18:09:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1663 transitions. [2021-11-25 18:09:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1505 [2021-11-25 18:09:04,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:09:04,592 INFO L514 BasicCegarLoop]: trace histogram [472, 471, 471, 30, 29, 29, 1, 1] [2021-11-25 18:09:04,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 18:09:04,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-25 18:09:04,807 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:09:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:09:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1003450308, now seen corresponding path program 21 times [2021-11-25 18:09:04,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:09:04,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624914189] [2021-11-25 18:09:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:09:04,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:09:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:09:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 347932 backedges. 238175 proven. 15278 refuted. 0 times theorem prover too weak. 94479 trivial. 0 not checked. [2021-11-25 18:09:06,359 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:09:06,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624914189] [2021-11-25 18:09:06,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624914189] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:09:06,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126239407] [2021-11-25 18:09:06,360 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:09:06,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:09:06,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:09:06,360 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:09:06,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 18:10:02,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:10:02,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:10:02,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 6633 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-25 18:10:02,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:10:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 347932 backedges. 296238 proven. 21184 refuted. 0 times theorem prover too weak. 30510 trivial. 0 not checked. [2021-11-25 18:10:05,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:10:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 347932 backedges. 296238 proven. 21184 refuted. 0 times theorem prover too weak. 30510 trivial. 0 not checked. [2021-11-25 18:10:07,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126239407] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:10:07,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1267431586] [2021-11-25 18:10:07,998 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:10:07,998 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:10:07,998 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:10:07,999 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:10:07,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:10:08,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:10:08,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:10:08,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:10:08,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:10:08,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:10:08,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:10:08,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:10:08,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:10:08,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:10:08,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:10:08,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:10:08,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:08,719 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:10:09,105 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '123904#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:10:09,105 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:10:09,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:10:09,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 48, 48] total 77 [2021-11-25 18:10:09,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701247675] [2021-11-25 18:10:09,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:10:09,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-11-25 18:10:09,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:09,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-11-25 18:10:09,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1501, Invalid=5471, Unknown=0, NotChecked=0, Total=6972 [2021-11-25 18:10:09,111 INFO L87 Difference]: Start difference. First operand 1589 states and 1663 transitions. Second operand has 78 states, 78 states have (on average 4.230769230769231) internal successors, (330), 77 states have internal predecessors, (330), 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) [2021-11-25 18:10:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:18,546 INFO L93 Difference]: Finished difference Result 1589 states and 1622 transitions. [2021-11-25 18:10:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 390 states. [2021-11-25 18:10:18,546 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 4.230769230769231) internal successors, (330), 77 states have internal predecessors, (330), 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 1504 [2021-11-25 18:10:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:18,552 INFO L225 Difference]: With dead ends: 1589 [2021-11-25 18:10:18,552 INFO L226 Difference]: Without dead ends: 1589 [2021-11-25 18:10:18,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4914 GetRequests, 4470 SyntacticMatches, 0 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73867 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=59021, Invalid=139449, Unknown=0, NotChecked=0, Total=198470 [2021-11-25 18:10:18,563 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:18,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:10:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-11-25 18:10:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-11-25 18:10:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.021410579345088) internal successors, (1622), 1588 states have internal predecessors, (1622), 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) [2021-11-25 18:10:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1622 transitions. [2021-11-25 18:10:18,581 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1622 transitions. Word has length 1504 [2021-11-25 18:10:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:18,582 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 1622 transitions. [2021-11-25 18:10:18,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 4.230769230769231) internal successors, (330), 77 states have internal predecessors, (330), 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) [2021-11-25 18:10:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1622 transitions. [2021-11-25 18:10:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1544 [2021-11-25 18:10:18,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:18,603 INFO L514 BasicCegarLoop]: trace histogram [485, 484, 484, 30, 29, 29, 1, 1] [2021-11-25 18:10:18,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 18:10:18,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-25 18:10:18,815 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:10:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1835447924, now seen corresponding path program 22 times [2021-11-25 18:10:18,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:18,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905789541] [2021-11-25 18:10:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:18,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 366938 backedges. 261063 proven. 17503 refuted. 0 times theorem prover too weak. 88372 trivial. 0 not checked. [2021-11-25 18:10:20,633 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:20,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905789541] [2021-11-25 18:10:20,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905789541] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:10:20,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933267243] [2021-11-25 18:10:20,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:10:20,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:20,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:10:20,634 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:10:20,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 18:10:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:21,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 6789 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-25 18:10:21,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:10:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 366938 backedges. 262755 proven. 15811 refuted. 0 times theorem prover too weak. 88372 trivial. 0 not checked. [2021-11-25 18:10:24,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:10:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 366938 backedges. 262755 proven. 15811 refuted. 0 times theorem prover too weak. 88372 trivial. 0 not checked. [2021-11-25 18:10:26,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933267243] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:10:26,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [464352259] [2021-11-25 18:10:26,808 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:10:26,809 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:10:26,809 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:10:26,809 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:10:26,809 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:10:26,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:10:26,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:10:26,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:10:26,947 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:10:26,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:10:27,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:27,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:10:27,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:10:27,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:27,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:10:27,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:10:27,271 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:10:27,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:10:27,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:27,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:10:27,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:10:27,430 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:10:27,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:10:27,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:27,488 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:10:27,859 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '137133#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:10:27,859 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:10:27,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:10:27,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 68 [2021-11-25 18:10:27,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206947000] [2021-11-25 18:10:27,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:10:27,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-11-25 18:10:27,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-11-25 18:10:27,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1137, Invalid=4413, Unknown=0, NotChecked=0, Total=5550 [2021-11-25 18:10:27,863 INFO L87 Difference]: Start difference. First operand 1589 states and 1622 transitions. Second operand has 69 states, 69 states have (on average 3.898550724637681) internal successors, (269), 68 states have internal predecessors, (269), 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) [2021-11-25 18:10:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:34,313 INFO L93 Difference]: Finished difference Result 1589 states and 1617 transitions. [2021-11-25 18:10:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2021-11-25 18:10:34,314 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.898550724637681) internal successors, (269), 68 states have internal predecessors, (269), 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 1543 [2021-11-25 18:10:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:34,319 INFO L225 Difference]: With dead ends: 1589 [2021-11-25 18:10:34,319 INFO L226 Difference]: Without dead ends: 1589 [2021-11-25 18:10:34,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4924 GetRequests, 4598 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37568 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=29818, Invalid=77438, Unknown=0, NotChecked=0, Total=107256 [2021-11-25 18:10:34,325 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:34,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 18:10:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-11-25 18:10:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-11-25 18:10:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.0182619647355164) internal successors, (1617), 1588 states have internal predecessors, (1617), 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) [2021-11-25 18:10:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1617 transitions. [2021-11-25 18:10:34,342 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1617 transitions. Word has length 1543 [2021-11-25 18:10:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:34,343 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 1617 transitions. [2021-11-25 18:10:34,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.898550724637681) internal successors, (269), 68 states have internal predecessors, (269), 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) [2021-11-25 18:10:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1617 transitions. [2021-11-25 18:10:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1559 [2021-11-25 18:10:34,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:34,363 INFO L514 BasicCegarLoop]: trace histogram [490, 489, 489, 30, 29, 29, 1, 1] [2021-11-25 18:10:34,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-25 18:10:34,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-25 18:10:34,571 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:10:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash 218154556, now seen corresponding path program 23 times [2021-11-25 18:10:34,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:34,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937820506] [2021-11-25 18:10:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:34,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 374383 backedges. 277851 proven. 19933 refuted. 0 times theorem prover too weak. 76599 trivial. 0 not checked. [2021-11-25 18:10:36,505 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937820506] [2021-11-25 18:10:36,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937820506] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:10:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402332551] [2021-11-25 18:10:36,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:10:36,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:36,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:10:36,507 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:10:36,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-25 18:10:40,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2021-11-25 18:10:40,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:10:40,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 2281 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 18:10:40,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:10:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 374383 backedges. 114833 proven. 10171 refuted. 0 times theorem prover too weak. 249379 trivial. 0 not checked. [2021-11-25 18:10:43,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:10:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 374383 backedges. 114770 proven. 10234 refuted. 0 times theorem prover too weak. 249379 trivial. 0 not checked. [2021-11-25 18:10:46,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402332551] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:10:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2128612263] [2021-11-25 18:10:46,919 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:10:46,919 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:10:46,919 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:10:46,919 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:10:46,919 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:10:46,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:10:46,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:10:46,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:10:47,033 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:10:47,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:10:47,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:47,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:10:47,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:10:47,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:47,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:47,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:10:47,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:47,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:47,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:10:47,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:47,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:10:47,564 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:10:48,388 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '150284#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:10:48,388 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:10:48,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:10:48,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 38, 38] total 119 [2021-11-25 18:10:48,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579053718] [2021-11-25 18:10:48,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:10:48,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2021-11-25 18:10:48,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2021-11-25 18:10:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2486, Invalid=13014, Unknown=0, NotChecked=0, Total=15500 [2021-11-25 18:10:48,395 INFO L87 Difference]: Start difference. First operand 1589 states and 1617 transitions. Second operand has 119 states, 119 states have (on average 3.495798319327731) internal successors, (416), 119 states have internal predecessors, (416), 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) [2021-11-25 18:11:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:11:14,606 INFO L93 Difference]: Finished difference Result 2209 states and 2272 transitions. [2021-11-25 18:11:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 493 states. [2021-11-25 18:11:14,607 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 119 states have (on average 3.495798319327731) internal successors, (416), 119 states have internal predecessors, (416), 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 1558 [2021-11-25 18:11:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:11:14,616 INFO L225 Difference]: With dead ends: 2209 [2021-11-25 18:11:14,616 INFO L226 Difference]: Without dead ends: 2209 [2021-11-25 18:11:14,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5208 GetRequests, 4596 SyntacticMatches, 0 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126394 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=67236, Invalid=309146, Unknown=0, NotChecked=0, Total=376382 [2021-11-25 18:11:14,638 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1918 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3547 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 3547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:11:14,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1918 Valid, 0 Invalid, 4571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 3547 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:11:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2021-11-25 18:11:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1598. [2021-11-25 18:11:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.0175328741390106) internal successors, (1625), 1597 states have internal predecessors, (1625), 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) [2021-11-25 18:11:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1625 transitions. [2021-11-25 18:11:14,659 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1625 transitions. Word has length 1558 [2021-11-25 18:11:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:11:14,660 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 1625 transitions. [2021-11-25 18:11:14,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 3.495798319327731) internal successors, (416), 119 states have internal predecessors, (416), 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) [2021-11-25 18:11:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1625 transitions. [2021-11-25 18:11:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2021-11-25 18:11:14,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:11:14,680 INFO L514 BasicCegarLoop]: trace histogram [497, 496, 496, 30, 29, 29, 1, 1] [2021-11-25 18:11:14,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-25 18:11:14,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:11:14,894 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:11:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:11:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1173860988, now seen corresponding path program 24 times [2021-11-25 18:11:14,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:11:14,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697287314] [2021-11-25 18:11:14,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:11:14,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:11:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:11:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 384932 backedges. 295852 proven. 22577 refuted. 0 times theorem prover too weak. 66503 trivial. 0 not checked. [2021-11-25 18:11:16,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:11:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697287314] [2021-11-25 18:11:16,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697287314] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:11:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30583909] [2021-11-25 18:11:16,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:11:16,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:11:16,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:11:16,802 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:11:16,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 18:12:26,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:12:26,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:12:26,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 6933 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-25 18:12:26,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:12:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 384932 backedges. 317823 proven. 23828 refuted. 0 times theorem prover too weak. 43281 trivial. 0 not checked. [2021-11-25 18:12:29,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:12:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 384932 backedges. 317823 proven. 23828 refuted. 0 times theorem prover too weak. 43281 trivial. 0 not checked. [2021-11-25 18:12:31,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30583909] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:12:31,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [461689543] [2021-11-25 18:12:31,530 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:12:31,530 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:12:31,530 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:12:31,530 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:12:31,531 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:12:31,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:12:31,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:12:31,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:31,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:12:31,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:12:31,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:31,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:12:31,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:31,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:31,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:12:31,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:31,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:12:31,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:12:31,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:31,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:12:32,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:12:32,071 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:12:32,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:12:32,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:32,134 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:12:32,530 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '164623#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:12:32,531 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:12:32,531 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:12:32,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 50, 50] total 78 [2021-11-25 18:12:32,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454601095] [2021-11-25 18:12:32,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:12:32,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2021-11-25 18:12:32,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:12:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-11-25 18:12:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1474, Invalid=5666, Unknown=0, NotChecked=0, Total=7140 [2021-11-25 18:12:32,535 INFO L87 Difference]: Start difference. First operand 1598 states and 1625 transitions. Second operand has 79 states, 79 states have (on average 4.025316455696203) internal successors, (318), 78 states have internal predecessors, (318), 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) [2021-11-25 18:12:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:12:42,214 INFO L93 Difference]: Finished difference Result 1598 states and 1620 transitions. [2021-11-25 18:12:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 376 states. [2021-11-25 18:12:42,214 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 4.025316455696203) internal successors, (318), 78 states have internal predecessors, (318), 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 1579 [2021-11-25 18:12:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:12:42,219 INFO L225 Difference]: With dead ends: 1598 [2021-11-25 18:12:42,220 INFO L226 Difference]: Without dead ends: 1598 [2021-11-25 18:12:42,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5132 GetRequests, 4700 SyntacticMatches, 0 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68958 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=54774, Invalid=133148, Unknown=0, NotChecked=0, Total=187922 [2021-11-25 18:12:42,231 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:12:42,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:12:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2021-11-25 18:12:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2021-11-25 18:12:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.0144020037570445) internal successors, (1620), 1597 states have internal predecessors, (1620), 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) [2021-11-25 18:12:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1620 transitions. [2021-11-25 18:12:42,248 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1620 transitions. Word has length 1579 [2021-11-25 18:12:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:12:42,249 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 1620 transitions. [2021-11-25 18:12:42,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.025316455696203) internal successors, (318), 78 states have internal predecessors, (318), 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) [2021-11-25 18:12:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1620 transitions. [2021-11-25 18:12:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1595 [2021-11-25 18:12:42,270 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:12:42,271 INFO L514 BasicCegarLoop]: trace histogram [502, 501, 501, 30, 29, 29, 1, 1] [2021-11-25 18:12:42,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-25 18:12:42,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-11-25 18:12:42,487 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:12:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:12:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1320349548, now seen corresponding path program 25 times [2021-11-25 18:12:42,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:12:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005010107] [2021-11-25 18:12:42,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:12:42,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:12:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:12:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 392557 backedges. 311364 proven. 25444 refuted. 0 times theorem prover too weak. 55749 trivial. 0 not checked. [2021-11-25 18:12:44,628 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:12:44,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005010107] [2021-11-25 18:12:44,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005010107] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:12:44,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665282286] [2021-11-25 18:12:44,628 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:12:44,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:12:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:12:44,643 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:12:44,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-25 18:12:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:12:46,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 6993 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-25 18:12:46,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:12:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 392557 backedges. 313554 proven. 23254 refuted. 0 times theorem prover too weak. 55749 trivial. 0 not checked. [2021-11-25 18:12:48,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:12:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 392557 backedges. 313554 proven. 23254 refuted. 0 times theorem prover too weak. 55749 trivial. 0 not checked. [2021-11-25 18:12:51,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665282286] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:12:51,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2005350119] [2021-11-25 18:12:51,223 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:12:51,223 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:12:51,223 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:12:51,223 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:12:51,223 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:12:51,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:12:51,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:12:51,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:51,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:12:51,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 236 [2021-11-25 18:12:51,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:51,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:12:51,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:12:51,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:51,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:12:51,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:51,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:12:51,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:12:51,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:51,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:12:51,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:12:51,744 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:12:51,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 123 [2021-11-25 18:12:51,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:12:51,797 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:12:52,190 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '178159#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:12:52,190 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:12:52,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:12:52,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 77 [2021-11-25 18:12:52,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862084040] [2021-11-25 18:12:52,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:12:52,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-11-25 18:12:52,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:12:52,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-11-25 18:12:52,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=5535, Unknown=0, NotChecked=0, Total=6972 [2021-11-25 18:12:52,194 INFO L87 Difference]: Start difference. First operand 1598 states and 1620 transitions. Second operand has 78 states, 78 states have (on average 3.91025641025641) internal successors, (305), 77 states have internal predecessors, (305), 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) [2021-11-25 18:13:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:13:01,387 INFO L93 Difference]: Finished difference Result 1598 states and 1619 transitions. [2021-11-25 18:13:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 351 states. [2021-11-25 18:13:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.91025641025641) internal successors, (305), 77 states have internal predecessors, (305), 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 1594 [2021-11-25 18:13:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:13:01,393 INFO L225 Difference]: With dead ends: 1598 [2021-11-25 18:13:01,393 INFO L226 Difference]: Without dead ends: 1598 [2021-11-25 18:13:01,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5155 GetRequests, 4748 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60231 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=47366, Invalid=119506, Unknown=0, NotChecked=0, Total=166872 [2021-11-25 18:13:01,404 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:13:01,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:13:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2021-11-25 18:13:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2021-11-25 18:13:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.0137758296806512) internal successors, (1619), 1597 states have internal predecessors, (1619), 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) [2021-11-25 18:13:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1619 transitions. [2021-11-25 18:13:01,420 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1619 transitions. Word has length 1594 [2021-11-25 18:13:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:13:01,422 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 1619 transitions. [2021-11-25 18:13:01,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.91025641025641) internal successors, (305), 77 states have internal predecessors, (305), 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) [2021-11-25 18:13:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1619 transitions. [2021-11-25 18:13:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1598 [2021-11-25 18:13:01,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:13:01,441 INFO L514 BasicCegarLoop]: trace histogram [503, 502, 502, 30, 29, 29, 1, 1] [2021-11-25 18:13:01,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-11-25 18:13:01,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:13:01,641 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:13:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:13:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 41941204, now seen corresponding path program 26 times [2021-11-25 18:13:01,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:13:01,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65648048] [2021-11-25 18:13:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:13:01,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:13:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:13:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 394091 backedges. 122491 proven. 247320 refuted. 0 times theorem prover too weak. 24280 trivial. 0 not checked. [2021-11-25 18:13:03,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:13:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65648048] [2021-11-25 18:13:03,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65648048] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:13:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612851437] [2021-11-25 18:13:03,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:13:03,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:13:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:13:03,822 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:13:03,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-25 18:13:16,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2021-11-25 18:13:16,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:13:16,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 18:13:16,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:13:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 394091 backedges. 165892 proven. 29561 refuted. 0 times theorem prover too weak. 198638 trivial. 0 not checked. [2021-11-25 18:13:20,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:13:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 394091 backedges. 165829 proven. 29624 refuted. 0 times theorem prover too weak. 198638 trivial. 0 not checked. [2021-11-25 18:13:24,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612851437] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:13:24,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1109836291] [2021-11-25 18:13:24,228 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:13:24,228 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:13:24,228 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:13:24,228 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:13:24,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:13:24,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:13:24,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-25 18:13:24,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-25 18:13:24,353 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:13:24,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 237 [2021-11-25 18:13:24,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:13:24,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:13:24,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:13:24,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:13:24,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:13:24,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:13:24,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:13:24,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:13:24,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:13:24,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-25 18:13:24,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:13:24,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:13:24,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2021-11-25 18:13:24,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-25 18:13:24,861 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:13:25,496 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '191714#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-25 18:13:25,496 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:13:25,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:13:25,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 38, 38] total 127 [2021-11-25 18:13:25,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733566175] [2021-11-25 18:13:25,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:13:25,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2021-11-25 18:13:25,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:13:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2021-11-25 18:13:25,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3144, Invalid=14412, Unknown=0, NotChecked=0, Total=17556 [2021-11-25 18:13:25,502 INFO L87 Difference]: Start difference. First operand 1598 states and 1619 transitions. Second operand has 127 states, 127 states have (on average 3.661417322834646) internal successors, (465), 127 states have internal predecessors, (465), 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) [2021-11-25 18:14:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:14:31,892 INFO L93 Difference]: Finished difference Result 2653 states and 2724 transitions. [2021-11-25 18:14:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 626 states. [2021-11-25 18:14:31,893 INFO L78 Accepts]: Start accepts. Automaton has has 127 states, 127 states have (on average 3.661417322834646) internal successors, (465), 127 states have internal predecessors, (465), 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 1597 [2021-11-25 18:14:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:14:31,908 INFO L225 Difference]: With dead ends: 2653 [2021-11-25 18:14:31,909 INFO L226 Difference]: Without dead ends: 2653 [2021-11-25 18:14:31,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5467 GetRequests, 4714 SyntacticMatches, 2 SemanticMatches, 751 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211431 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=131746, Invalid=434510, Unknown=0, NotChecked=0, Total=566256 [2021-11-25 18:14:31,935 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6863 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 4071 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6863 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4071 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:14:31,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6863 Valid, 0 Invalid, 5886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4071 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-11-25 18:14:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2021-11-25 18:14:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1775. [2021-11-25 18:14:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 1.0146561443066517) internal successors, (1800), 1774 states have internal predecessors, (1800), 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) [2021-11-25 18:14:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1800 transitions. [2021-11-25 18:14:31,962 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1800 transitions. Word has length 1597 [2021-11-25 18:14:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:14:31,964 INFO L470 AbstractCegarLoop]: Abstraction has 1775 states and 1800 transitions. [2021-11-25 18:14:31,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 3.661417322834646) internal successors, (465), 127 states have internal predecessors, (465), 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) [2021-11-25 18:14:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1800 transitions. [2021-11-25 18:14:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1775 [2021-11-25 18:14:31,986 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:14:31,987 INFO L514 BasicCegarLoop]: trace histogram [560, 559, 559, 32, 31, 31, 1, 1] [2021-11-25 18:14:32,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2021-11-25 18:14:32,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-11-25 18:14:32,188 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:14:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:14:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1592224788, now seen corresponding path program 27 times [2021-11-25 18:14:32,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:14:32,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014591847] [2021-11-25 18:14:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:14:32,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:14:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:14:36,617 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 18:14:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:14:41,516 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 18:14:41,516 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 18:14:41,517 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (7 of 8 remaining) [2021-11-25 18:14:41,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (6 of 8 remaining) [2021-11-25 18:14:41,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (5 of 8 remaining) [2021-11-25 18:14:41,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (4 of 8 remaining) [2021-11-25 18:14:41,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (3 of 8 remaining) [2021-11-25 18:14:41,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (2 of 8 remaining) [2021-11-25 18:14:41,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (1 of 8 remaining) [2021-11-25 18:14:41,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2021-11-25 18:14:41,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-25 18:14:41,524 INFO L732 BasicCegarLoop]: Path program histogram: [27, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:14:41,532 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 18:14:42,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:14:42 BoogieIcfgContainer [2021-11-25 18:14:42,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 18:14:42,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 18:14:42,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 18:14:42,208 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 18:14:42,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:04:26" (3/4) ... [2021-11-25 18:14:42,210 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 18:14:42,762 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 18:14:42,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 18:14:42,763 INFO L158 Benchmark]: Toolchain (without parser) took 617505.20ms. Allocated memory was 94.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 52.9MB in the beginning and 577.2MB in the end (delta: -524.3MB). Peak memory consumption was 947.3MB. Max. memory is 16.1GB. [2021-11-25 18:14:42,763 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 68.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:14:42,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.74ms. Allocated memory is still 94.4MB. Free memory was 52.7MB in the beginning and 70.0MB in the end (delta: -17.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-25 18:14:42,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.01ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:14:42,764 INFO L158 Benchmark]: Boogie Preprocessor took 35.00ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 67.3MB in the end (delta: 988.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:14:42,764 INFO L158 Benchmark]: RCFGBuilder took 374.87ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 55.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 18:14:42,772 INFO L158 Benchmark]: TraceAbstraction took 616165.33ms. Allocated memory was 94.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 54.3MB in the beginning and 688.4MB in the end (delta: -634.1MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-11-25 18:14:42,772 INFO L158 Benchmark]: Witness Printer took 554.89ms. Allocated memory is still 1.6GB. Free memory was 688.4MB in the beginning and 577.2MB in the end (delta: 111.1MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2021-11-25 18:14:42,773 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.29ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 68.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.74ms. Allocated memory is still 94.4MB. Free memory was 52.7MB in the beginning and 70.0MB in the end (delta: -17.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.01ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.00ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 67.3MB in the end (delta: 988.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 374.87ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 55.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 616165.33ms. Allocated memory was 94.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 54.3MB in the beginning and 688.4MB in the end (delta: -634.1MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 554.89ms. Allocated memory is still 1.6GB. Free memory was 688.4MB in the beginning and 577.2MB in the end (delta: 111.1MB). Peak memory consumption was 111.1MB. 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: 18]: array index can be out of bounds array index can be out of bounds We found a FailurePath: [L24] int i, b[32]; [L25] char mask[32]; [L26] i = 0 VAL [b={34:0}, i=0, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=1, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=2, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=3, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=4, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=5, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=6, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=7, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=8, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=9, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=10, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=11, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=12, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=13, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=14, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=15, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=16, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=17, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=18, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=19, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=20, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=21, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=22, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=23, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=24, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=25, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=26, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=27, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=28, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=29, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=30, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=31, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L18] a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: 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, 19 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 615.4s, OverallIterations: 45, TraceHistogramMax: 560, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.6s, AutomataDifference: 243.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20234 SdHoareTripleChecker+Valid, 27.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20234 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 22.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 1030 mSDsCounter, 12769 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44284 IncrementalHoareTripleChecker+Invalid, 57090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12769 mSolverCounterUnsat, 121 mSDtfsCounter, 44284 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69696 GetRequests, 62375 SyntacticMatches, 15 SemanticMatches, 7306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136804 ImplicationChecksByTransitivity, 250.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1775occurred in iteration=44, InterpolantAutomatonStates: 5867, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 6005 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3.0s SsaConstructionTime, 205.2s SatisfiabilityAnalysisTime, 102.0s InterpolantComputationTime, 44350 NumberOfCodeBlocks, 39154 NumberOfCodeBlocksAsserted, 287 NumberOfCheckSat, 63554 ConstructedInterpolants, 106 QuantifiedInterpolants, 140625 SizeOfPredicates, 134 NumberOfNonLiveVariables, 72981 ConjunctsInSsa, 915 ConjunctsInUnsatCore, 113 InterpolantComputations, 12 PerfectInterpolantSequences, 10897177/12080994 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: OVERALL_TIME: 0.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 4, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.5s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 14, TOOLS_QUANTIFIERELIM_TIME: 0.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 28, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 4, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 34, DAG_COMPRESSION_RETAINED_NODES: 20, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-25 18:14:42,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f199595d-224f-492b-bf8c-305495e6d71f/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)