./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.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_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/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_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/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_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/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 9aaf3ef5b6218ff6658a67703b1e3ffb0d16a40e5e7c9a13354b853d6f63747b --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:44:47,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:44:47,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:44:47,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:44:47,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:44:47,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:44:47,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:44:47,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:44:47,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:44:47,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:44:47,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:44:47,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:44:47,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:44:47,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:44:47,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:44:47,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:44:47,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:44:47,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:44:47,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:44:47,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:44:47,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:44:47,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:44:47,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:44:47,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:44:47,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:44:47,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:44:47,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:44:47,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:44:47,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:44:47,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:44:47,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:44:47,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:44:47,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:44:47,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:44:47,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:44:47,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:44:47,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:44:47,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:44:47,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:44:47,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:44:47,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:44:47,458 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-25 18:44:47,483 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:44:47,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:44:47,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:44:47,484 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:44:47,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:44:47,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:44:47,485 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:44:47,485 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:44:47,486 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:44:47,486 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:44:47,486 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:44:47,486 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:44:47,486 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:44:47,486 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:44:47,486 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:44:47,487 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:44:47,487 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:44:47,487 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:44:47,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 18:44:47,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 18:44:47,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:44:47,488 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:44:47,489 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 18:44:47,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:44:47,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:44:47,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:44:47,489 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 18:44:47,489 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 18:44:47,490 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 18:44:47,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:44:47,490 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 18:44:47,490 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:44:47,490 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:44:47,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:44:47,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:44:47,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:44:47,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:44:47,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:44:47,491 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:44:47,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:44:47,492 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:44:47,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:44:47,492 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_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/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_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/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 -> 9aaf3ef5b6218ff6658a67703b1e3ffb0d16a40e5e7c9a13354b853d6f63747b [2021-11-25 18:44:47,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:44:47,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:44:47,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:44:47,800 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:44:47,800 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:44:47,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2021-11-25 18:44:47,878 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/data/b9b1591b5/27964a77c38e4943a501b0bc3300cf3c/FLAG9752d151e [2021-11-25 18:44:48,332 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:44:48,333 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2021-11-25 18:44:48,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/data/b9b1591b5/27964a77c38e4943a501b0bc3300cf3c/FLAG9752d151e [2021-11-25 18:44:48,730 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/data/b9b1591b5/27964a77c38e4943a501b0bc3300cf3c [2021-11-25 18:44:48,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:44:48,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:44:48,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:44:48,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:44:48,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:44:48,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:44:48" (1/1) ... [2021-11-25 18:44:48,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7216720c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:48, skipping insertion in model container [2021-11-25 18:44:48,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:44:48" (1/1) ... [2021-11-25 18:44:48,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:44:48,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:44:48,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:44:49,000 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:44:49,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:44:49,036 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:44:49,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49 WrapperNode [2021-11-25 18:44:49,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:44:49,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:44:49,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:44:49,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:44:49,046 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:44:49" (1/1) ... [2021-11-25 18:44:49,054 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:44:49" (1/1) ... [2021-11-25 18:44:49,081 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2021-11-25 18:44:49,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:44:49,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:44:49,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:44:49,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:44:49,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:44:49,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:44:49,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:44:49,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:44:49,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (1/1) ... [2021-11-25 18:44:49,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:44:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:49,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:44:49,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:44:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:44:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:44:49,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:44:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:44:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:44:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:44:49,298 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:44:49,300 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:44:49,485 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:44:49,531 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:44:49,531 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-25 18:44:49,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:44:49 BoogieIcfgContainer [2021-11-25 18:44:49,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:44:49,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:44:49,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:44:49,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:44:49,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:44:48" (1/3) ... [2021-11-25 18:44:49,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957e688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:44:49, skipping insertion in model container [2021-11-25 18:44:49,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:44:49" (2/3) ... [2021-11-25 18:44:49,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957e688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:44:49, skipping insertion in model container [2021-11-25 18:44:49,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:44:49" (3/3) ... [2021-11-25 18:44:49,542 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-read.c [2021-11-25 18:44:49,548 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:44:49,548 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-11-25 18:44:49,594 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:44:49,600 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:44:49,600 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-25 18:44:49,616 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:44:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:44:49,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:49,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:44:49,624 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:44:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash 3271901, now seen corresponding path program 1 times [2021-11-25 18:44:49,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:49,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268943522] [2021-11-25 18:44:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:49,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:49,885 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:44:49,886 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:49,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268943522] [2021-11-25 18:44:49,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268943522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:49,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:44:49,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:44:49,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137586155] [2021-11-25 18:44:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:49,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:44:49,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:44:49,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:44:49,922 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:44:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:50,015 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-11-25 18:44:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:44:50,019 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:44:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:50,026 INFO L225 Difference]: With dead ends: 37 [2021-11-25 18:44:50,027 INFO L226 Difference]: Without dead ends: 35 [2021-11-25 18:44:50,028 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:44:50,033 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:44:50,035 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:44:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-25 18:44:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2021-11-25 18:44:50,069 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:44:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-25 18:44:50,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 4 [2021-11-25 18:44:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:50,072 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-25 18:44:50,072 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:44:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-25 18:44:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:44:50,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:50,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:44:50,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:44:50,076 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:44:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 3197824, now seen corresponding path program 1 times [2021-11-25 18:44:50,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:50,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381347422] [2021-11-25 18:44:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:50,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:50,148 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:44:50,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:50,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381347422] [2021-11-25 18:44:50,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381347422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:50,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:44:50,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:44:50,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630229347] [2021-11-25 18:44:50,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:50,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:44:50,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:44:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:44:50,152 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:44:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:50,185 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2021-11-25 18:44:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:44:50,186 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:44:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:50,187 INFO L225 Difference]: With dead ends: 37 [2021-11-25 18:44:50,187 INFO L226 Difference]: Without dead ends: 37 [2021-11-25 18:44:50,187 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:44:50,189 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:44:50,190 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:44:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-25 18:44:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2021-11-25 18:44:50,194 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:44:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-11-25 18:44:50,195 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 4 [2021-11-25 18:44:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:50,195 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-25 18:44:50,195 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:44:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-11-25 18:44:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:44:50,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:50,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:44:50,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:44:50,196 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:44:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash 3199854, now seen corresponding path program 1 times [2021-11-25 18:44:50,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:50,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104819235] [2021-11-25 18:44:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:50,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:50,247 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:44:50,247 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:50,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104819235] [2021-11-25 18:44:50,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104819235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:50,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:44:50,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:44:50,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509058284] [2021-11-25 18:44:50,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:50,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:44:50,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:44:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:44:50,250 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:44:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:50,337 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-11-25 18:44:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:44:50,337 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:44:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:50,339 INFO L225 Difference]: With dead ends: 42 [2021-11-25 18:44:50,339 INFO L226 Difference]: Without dead ends: 42 [2021-11-25 18:44:50,339 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:44:50,341 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:44:50,341 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:44:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-25 18:44:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2021-11-25 18:44:50,345 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:44:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-25 18:44:50,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 4 [2021-11-25 18:44:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:50,346 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-25 18:44:50,347 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:44:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-25 18:44:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:44:50,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:50,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:44:50,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:44:50,348 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:44:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 99132597, now seen corresponding path program 1 times [2021-11-25 18:44:50,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:50,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792599080] [2021-11-25 18:44:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:50,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:50,406 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:44:50,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792599080] [2021-11-25 18:44:50,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792599080] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:50,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:44:50,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:44:50,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380628102] [2021-11-25 18:44:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:50,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:44:50,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:44:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:44:50,411 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:44:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:50,466 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-11-25 18:44:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:44:50,467 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:44:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:50,470 INFO L225 Difference]: With dead ends: 22 [2021-11-25 18:44:50,470 INFO L226 Difference]: Without dead ends: 22 [2021-11-25 18:44:50,471 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:44:50,474 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:44:50,478 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:44:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-25 18:44:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-25 18:44:50,485 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:44:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-11-25 18:44:50,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2021-11-25 18:44:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:50,487 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-25 18:44:50,487 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:44:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-11-25 18:44:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:44:50,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:50,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:44:50,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:44:50,488 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:44:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash 99132598, now seen corresponding path program 1 times [2021-11-25 18:44:50,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:50,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614755729] [2021-11-25 18:44:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:50,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:50,590 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:44:50,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:50,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614755729] [2021-11-25 18:44:50,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614755729] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:50,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:44:50,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:44:50,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540609094] [2021-11-25 18:44:50,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:50,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:44:50,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:50,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:44:50,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:44:50,593 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:44:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:50,693 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-11-25 18:44:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:44:50,694 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:44:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:50,695 INFO L225 Difference]: With dead ends: 35 [2021-11-25 18:44:50,695 INFO L226 Difference]: Without dead ends: 35 [2021-11-25 18:44:50,696 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:44:50,699 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:44:50,701 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:44:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-25 18:44:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2021-11-25 18:44:50,706 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:44:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-25 18:44:50,707 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2021-11-25 18:44:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:50,707 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-25 18:44:50,708 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:44:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-25 18:44:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 18:44:50,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:50,708 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-11-25 18:44:50,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 18:44:50,711 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:44:50,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash 777193832, now seen corresponding path program 1 times [2021-11-25 18:44:50,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:50,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020513230] [2021-11-25 18:44:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:50,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:50,775 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:44:50,775 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020513230] [2021-11-25 18:44:50,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020513230] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510281212] [2021-11-25 18:44:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:50,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:50,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:44:50,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:44:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:50,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:44:50,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:50,870 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:44:50,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:50,942 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:44:50,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510281212] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:44:50,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671330629] [2021-11-25 18:44:50,966 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2021-11-25 18:44:50,966 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:44:50,970 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:44:50,974 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:44:50,974 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:44:51,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:51,049 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:44:51,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:44:51,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:51,342 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 230 treesize of output 232 [2021-11-25 18:44:51,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:51,489 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:44:51,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1671330629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:51,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:44:51,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 3] total 8 [2021-11-25 18:44:51,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453601085] [2021-11-25 18:44:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:51,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:44:51,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:44:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:44:51,702 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:44:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:52,100 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-11-25 18:44:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:44:52,101 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:44:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:52,101 INFO L225 Difference]: With dead ends: 30 [2021-11-25 18:44:52,101 INFO L226 Difference]: Without dead ends: 30 [2021-11-25 18:44:52,102 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:44:52,103 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:44:52,103 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:44:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-25 18:44:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-11-25 18:44:52,106 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:44:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-11-25 18:44:52,107 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2021-11-25 18:44:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:52,107 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-25 18:44:52,107 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:44:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-11-25 18:44:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 18:44:52,108 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:52,108 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2021-11-25 18:44:52,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:44:52,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:52,324 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:44:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1676794930, now seen corresponding path program 1 times [2021-11-25 18:44:52,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:52,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224131949] [2021-11-25 18:44:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:52,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:44:52,417 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:52,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224131949] [2021-11-25 18:44:52,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224131949] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:52,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696853329] [2021-11-25 18:44:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:52,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:52,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:52,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:44:52,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:44:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:52,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 18:44:52,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:52,494 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:44:52,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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-11-25 18:44:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:44:52,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:44:52,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696853329] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:44:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1836266946] [2021-11-25 18:44:52,692 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2021-11-25 18:44:52,692 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:44:52,692 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:44:52,692 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:44:52,692 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:44:52,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:52,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, 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:44:52,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:52,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:52,922 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 230 treesize of output 232 [2021-11-25 18:44:53,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:53,034 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:44:53,360 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '491#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |ULTIMATE.start_foo_#in~size#1| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:44:53,361 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:44:53,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:44:53,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2021-11-25 18:44:53,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57924187] [2021-11-25 18:44:53,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:44:53,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:44:53,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:44:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:44:53,363 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:44:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:53,731 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2021-11-25 18:44:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:44:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-25 18:44:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:53,736 INFO L225 Difference]: With dead ends: 100 [2021-11-25 18:44:53,736 INFO L226 Difference]: Without dead ends: 100 [2021-11-25 18:44:53,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2021-11-25 18:44:53,738 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 189 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:44:53,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 41 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:44:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-25 18:44:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 47. [2021-11-25 18:44:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.525) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 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:44:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-11-25 18:44:53,752 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 8 [2021-11-25 18:44:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:53,752 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-11-25 18:44:53,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:44:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-11-25 18:44:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:44:53,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:53,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:44:53,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:44:53,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:53,962 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:44:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash -725463176, now seen corresponding path program 1 times [2021-11-25 18:44:53,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:53,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699990458] [2021-11-25 18:44:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:53,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:54,021 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:44:54,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:54,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699990458] [2021-11-25 18:44:54,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699990458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:54,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:44:54,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:44:54,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474341277] [2021-11-25 18:44:54,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:54,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:44:54,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:44:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:44:54,027 INFO L87 Difference]: Start difference. First operand 47 states and 61 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:44:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:54,048 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2021-11-25 18:44:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:44:54,049 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:44:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:54,051 INFO L225 Difference]: With dead ends: 45 [2021-11-25 18:44:54,052 INFO L226 Difference]: Without dead ends: 45 [2021-11-25 18:44:54,052 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:44:54,053 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 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:44:54,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:44:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-25 18:44:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-25 18:44:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.475) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 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:44:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2021-11-25 18:44:54,067 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 10 [2021-11-25 18:44:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:54,067 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2021-11-25 18:44:54,067 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:44:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2021-11-25 18:44:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:44:54,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:54,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:44:54,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 18:44:54,069 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:44:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -725463175, now seen corresponding path program 1 times [2021-11-25 18:44:54,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:54,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872619778] [2021-11-25 18:44:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:54,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:54,138 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:44:54,138 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:54,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872619778] [2021-11-25 18:44:54,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872619778] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:54,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81249688] [2021-11-25 18:44:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:54,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:54,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:54,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:44:54,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:44:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:54,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:44:54,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:54,245 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:44:54,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:54,284 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:44:54,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81249688] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:44:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [969050872] [2021-11-25 18:44:54,290 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-11-25 18:44:54,290 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:44:54,291 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:44:54,291 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:44:54,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:44:54,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:54,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, 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:44:54,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:54,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:54,532 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 230 treesize of output 232 [2021-11-25 18:44:54,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:54,660 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:44: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:44:54,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:54,851 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:44:54,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:44:54,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:54,978 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 116 treesize of output 118 [2021-11-25 18:44:55,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:55,062 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:44:55,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:55,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:55,201 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 116 treesize of output 118 [2021-11-25 18:44:55,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:55,287 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:44:55,615 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '811#(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:44:55,615 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:44:55,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:44:55,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2021-11-25 18:44:55,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694752398] [2021-11-25 18:44:55,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:44:55,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:44:55,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:44:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:44:55,617 INFO L87 Difference]: Start difference. First operand 45 states and 59 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:44:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:55,806 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-11-25 18:44:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:44:55,807 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:44:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:55,807 INFO L225 Difference]: With dead ends: 48 [2021-11-25 18:44:55,807 INFO L226 Difference]: Without dead ends: 48 [2021-11-25 18:44:55,808 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:44:55,808 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:44:55,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 6 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:44:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-25 18:44:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-11-25 18:44:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 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:44:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2021-11-25 18:44:55,813 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 10 [2021-11-25 18:44:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:55,813 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2021-11-25 18:44:55,813 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:44:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2021-11-25 18:44:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:44:55,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:55,814 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:44:55,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:44:56,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:56,024 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:44:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1174809817, now seen corresponding path program 1 times [2021-11-25 18:44:56,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143176853] [2021-11-25 18:44:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:56,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:56,080 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:44:56,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:56,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143176853] [2021-11-25 18:44:56,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143176853] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:56,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900003291] [2021-11-25 18:44:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:56,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:56,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:56,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:44:56,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:44:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:56,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-25 18:44:56,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:56,334 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:44:56,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:44:56,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900003291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:56,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:44:56,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2021-11-25 18:44:56,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087798646] [2021-11-25 18:44:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:56,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:44:56,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:44:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:44:56,336 INFO L87 Difference]: Start difference. First operand 46 states and 57 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:44:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:56,343 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-11-25 18:44:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:44:56,343 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:44:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:56,344 INFO L225 Difference]: With dead ends: 48 [2021-11-25 18:44:56,344 INFO L226 Difference]: Without dead ends: 47 [2021-11-25 18:44:56,344 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:44:56,345 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 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:44:56,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2021-11-25 18:44:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-25 18:44:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-11-25 18:44:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.380952380952381) internal successors, (58), 46 states have internal predecessors, (58), 0 states have call successors, (0), 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:44:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2021-11-25 18:44:56,352 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 15 [2021-11-25 18:44:56,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:56,353 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2021-11-25 18:44:56,353 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:44:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2021-11-25 18:44:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:44:56,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:56,355 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:44:56,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:44:56,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:56,580 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:44:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2059371235, now seen corresponding path program 1 times [2021-11-25 18:44:56,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892103261] [2021-11-25 18:44:56,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:56,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:56,629 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:44:56,629 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:56,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892103261] [2021-11-25 18:44:56,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892103261] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726552775] [2021-11-25 18:44:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:56,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:56,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:44:56,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:44:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:56,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:44:56,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:56,815 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:44:56,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:44:56,872 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:44:56,872 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:44:56,889 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:44:56,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:56,943 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:44:56,948 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:44:57,120 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:44:57,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726552775] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:44:57,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [548535004] [2021-11-25 18:44:57,123 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-25 18:44:57,123 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:44:57,123 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:44:57,123 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:44:57,124 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:44:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:57,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, 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:44:57,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:57,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:57,305 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 230 treesize of output 232 [2021-11-25 18:44:57,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:57,415 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:44:57,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:57,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:57,657 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:44:57,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:57,792 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:44:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 119 [2021-11-25 18:44:57,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44: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:44:57,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:57,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:57,980 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 116 treesize of output 118 [2021-11-25 18:44:58,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:44:58,139 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:58,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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:44:58,167 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:44:58,657 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1178#(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:44:58,657 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:44:58,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:44:58,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2021-11-25 18:44:58,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606927585] [2021-11-25 18:44:58,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:44:58,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:44:58,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:44:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:44:58,659 INFO L87 Difference]: Start difference. First operand 47 states and 58 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:44:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:58,832 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2021-11-25 18:44:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:44:58,832 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:44:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:58,833 INFO L225 Difference]: With dead ends: 74 [2021-11-25 18:44:58,833 INFO L226 Difference]: Without dead ends: 74 [2021-11-25 18:44:58,834 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:44:58,834 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:44:58,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 39 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:44:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-25 18:44:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. [2021-11-25 18:44:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 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:44:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2021-11-25 18:44:58,839 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 16 [2021-11-25 18:44:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:58,839 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2021-11-25 18:44:58,839 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:44:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2021-11-25 18:44:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:44:58,840 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:58,840 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2021-11-25 18:44:58,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:44:59,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-25 18:44:59,041 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:44:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash -26544458, now seen corresponding path program 2 times [2021-11-25 18:44:59,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:59,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110788063] [2021-11-25 18:44:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:59,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 18:44:59,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110788063] [2021-11-25 18:44:59,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110788063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:44:59,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:44:59,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 18:44:59,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090929576] [2021-11-25 18:44:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:44:59,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:44:59,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:44:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:44:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:44:59,131 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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:44:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:59,198 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-11-25 18:44:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:44:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 17 [2021-11-25 18:44:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:59,199 INFO L225 Difference]: With dead ends: 41 [2021-11-25 18:44:59,199 INFO L226 Difference]: Without dead ends: 41 [2021-11-25 18:44:59,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:44:59,200 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:44:59,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:44:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-11-25 18:44:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-11-25 18:44:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 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:44:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-11-25 18:44:59,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 17 [2021-11-25 18:44:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:59,211 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-11-25 18:44:59,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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:44:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2021-11-25 18:44:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:44:59,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:59,212 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1] [2021-11-25 18:44:59,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 18:44:59,212 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:44:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1892592084, now seen corresponding path program 1 times [2021-11-25 18:44:59,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:44:59,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468740611] [2021-11-25 18:44:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:59,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:44:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:44:59,282 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:44:59,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468740611] [2021-11-25 18:44:59,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468740611] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:59,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187947135] [2021-11-25 18:44:59,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:59,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:59,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:59,288 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:44:59,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:44:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:59,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 18:44:59,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:44:59,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:44:59,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187947135] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:44:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [361438331] [2021-11-25 18:44:59,461 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:44:59,461 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:44:59,462 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:44:59,462 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:44:59,462 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:44:59,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:59,477 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:44:59,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:59,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:44:59,664 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 230 treesize of output 232 [2021-11-25 18:44:59,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:59,767 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:44:59,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:59,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44:59,926 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:44:59,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:45:00,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:00,056 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 116 treesize of output 118 [2021-11-25 18:45:00,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:00,131 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:45:00,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:00,240 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:00,241 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 113 treesize of output 119 [2021-11-25 18:45:00,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:00,327 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:00,600 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1525#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 33 |ULTIMATE.start_foo_~i~0#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 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:45:00,601 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:00,601 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:00,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-25 18:45:00,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809880197] [2021-11-25 18:45:00,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:00,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:45:00,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:00,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:45:00,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:45:00,602 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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:45:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:00,724 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2021-11-25 18:45:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:45:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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 19 [2021-11-25 18:45:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:00,726 INFO L225 Difference]: With dead ends: 99 [2021-11-25 18:45:00,726 INFO L226 Difference]: Without dead ends: 99 [2021-11-25 18:45:00,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:45:00,727 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 108 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:00,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 38 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:45:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-25 18:45:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 46. [2021-11-25 18:45:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2021-11-25 18:45:00,731 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 19 [2021-11-25 18:45:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:00,731 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-11-25 18:45:00,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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:45:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2021-11-25 18:45:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:45:00,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:00,732 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1] [2021-11-25 18:45:00,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:00,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 18:45:00,944 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:45:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1892594115, now seen corresponding path program 1 times [2021-11-25 18:45:00,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:00,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269529458] [2021-11-25 18:45:00,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:00,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:01,021 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:45:01,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:01,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269529458] [2021-11-25 18:45:01,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269529458] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:01,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134617047] [2021-11-25 18:45:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:01,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:01,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:01,023 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:01,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:45:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:01,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:45:01,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:01,192 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:45:01,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:01,247 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:45:01,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134617047] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:01,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1301547497] [2021-11-25 18:45:01,249 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:01,250 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:01,250 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:01,250 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:01,251 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:01,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:01,264 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:45:01,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:01,449 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:01,450 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 227 treesize of output 233 [2021-11-25 18:45:01,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:45:01,588 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:45:01,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 10 treesize of output 9 [2021-11-25 18:45:01,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:01,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:01,827 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:45:01,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:45:01,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:01,924 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 116 treesize of output 118 [2021-11-25 18:45:01,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:01,996 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:45:02,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:02,112 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:02,113 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 113 treesize of output 119 [2021-11-25 18:45:02,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:02,187 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:02,465 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1802#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |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|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_#in~size#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) (<= 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|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (< (+ |ULTIMATE.start_foo_~size#1| 1) |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:02,465 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:02,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:02,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-25 18:45:02,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614927051] [2021-11-25 18:45:02,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:02,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:45:02,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:45:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:45:02,467 INFO L87 Difference]: Start difference. First operand 46 states and 54 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:45:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:02,601 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-11-25 18:45:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:45:02,602 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:45:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:02,603 INFO L225 Difference]: With dead ends: 46 [2021-11-25 18:45:02,603 INFO L226 Difference]: Without dead ends: 46 [2021-11-25 18:45:02,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:45:02,604 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:02,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 3 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:45:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-25 18:45:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-11-25 18:45:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 45 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:45:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-11-25 18:45:02,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 19 [2021-11-25 18:45:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:02,608 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-11-25 18:45:02,608 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:45:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-11-25 18:45:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:45:02,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:02,610 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1] [2021-11-25 18:45:02,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:02,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 18:45:02,828 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2119785853, now seen corresponding path program 2 times [2021-11-25 18:45:02,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:02,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414251962] [2021-11-25 18:45:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:02,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:02,921 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:45:02,922 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414251962] [2021-11-25 18:45:02,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414251962] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975027079] [2021-11-25 18:45:02,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:02,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:02,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:02,924 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:02,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:45:02,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:45:02,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:02,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-25 18:45:02,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:02,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:02,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, 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:45:02,999 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:45:03,277 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:45:03,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:45:03,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975027079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:45:03,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:45:03,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2021-11-25 18:45:03,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139117367] [2021-11-25 18:45:03,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:45:03,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:45:03,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:03,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:45:03,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:45:03,279 INFO L87 Difference]: Start difference. First operand 46 states and 53 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:45:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:03,348 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2021-11-25 18:45:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:45:03,349 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:45:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:03,350 INFO L225 Difference]: With dead ends: 45 [2021-11-25 18:45:03,350 INFO L226 Difference]: Without dead ends: 45 [2021-11-25 18:45:03,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:45:03,351 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:03,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 11 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:45:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-25 18:45:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-25 18:45:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 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:45:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-11-25 18:45:03,354 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 22 [2021-11-25 18:45:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:03,354 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-11-25 18:45:03,355 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:45:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-11-25 18:45:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 18:45:03,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:03,356 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 2, 1, 1, 1, 1] [2021-11-25 18:45:03,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:03,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 18:45:03,568 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1054979870, now seen corresponding path program 1 times [2021-11-25 18:45:03,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:03,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754355387] [2021-11-25 18:45:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:03,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 18:45:03,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:03,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754355387] [2021-11-25 18:45:03,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754355387] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:03,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593315615] [2021-11-25 18:45:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:03,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:03,666 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:03,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:45:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:03,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:45:03,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 18:45:03,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 18:45:03,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593315615] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:03,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1098341854] [2021-11-25 18:45:03,924 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:03,924 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:03,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:03,924 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:03,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:03,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:03,937 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:45:03,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:04,089 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:04,089 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 227 treesize of output 233 [2021-11-25 18:45:04,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:04,183 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:45:04,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:04,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:04,331 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:45:04,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:04,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:04,440 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 116 treesize of output 118 [2021-11-25 18:45:04,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:45:04,513 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:45:04,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 15 treesize of output 14 [2021-11-25 18:45:04,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:04,616 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 116 treesize of output 118 [2021-11-25 18:45:04,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:04,684 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:05,021 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2240#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:05,021 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:05,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:05,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-11-25 18:45:05,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356316172] [2021-11-25 18:45:05,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:05,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:45:05,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:45:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:45:05,023 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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:45:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:05,227 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-11-25 18:45:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 18:45:05,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 18:45:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:05,229 INFO L225 Difference]: With dead ends: 77 [2021-11-25 18:45:05,229 INFO L226 Difference]: Without dead ends: 77 [2021-11-25 18:45:05,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:45:05,230 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 125 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:05,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 17 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:45:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-25 18:45:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2021-11-25 18:45:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2021-11-25 18:45:05,233 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 26 [2021-11-25 18:45:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:05,234 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2021-11-25 18:45:05,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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:45:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2021-11-25 18:45:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 18:45:05,235 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:05,235 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-11-25 18:45:05,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:05,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 18:45:05,460 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:05,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash -934045657, now seen corresponding path program 1 times [2021-11-25 18:45:05,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:05,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741749974] [2021-11-25 18:45:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:05,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:05,523 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:45:05,524 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741749974] [2021-11-25 18:45:05,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741749974] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198668260] [2021-11-25 18:45:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:05,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:05,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:05,525 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:05,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 18:45:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:05,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:45:05,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:05,793 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:45:05,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:05,885 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:45:06,040 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:45:06,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198668260] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:06,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [899247008] [2021-11-25 18:45:06,043 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:45:06,043 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:06,043 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:06,043 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:06,043 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:06,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:06,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, 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:45:06,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:45:06,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:06,184 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 230 treesize of output 232 [2021-11-25 18:45:06,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:06,277 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:45:06,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:45:06,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:45:06,431 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:45:06,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:06,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:06,549 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 116 treesize of output 118 [2021-11-25 18:45:06,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:06,622 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:45:06,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:06,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:06,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 116 treesize of output 118 [2021-11-25 18:45:06,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:06,845 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:07,229 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2577#(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:45:07,230 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:07,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:07,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2021-11-25 18:45:07,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868322755] [2021-11-25 18:45:07,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:07,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:45:07,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:07,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:45:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:45:07,232 INFO L87 Difference]: Start difference. First operand 55 states and 62 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:45:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:07,392 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2021-11-25 18:45:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:45:07,392 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:45:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:07,393 INFO L225 Difference]: With dead ends: 90 [2021-11-25 18:45:07,393 INFO L226 Difference]: Without dead ends: 90 [2021-11-25 18:45:07,394 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:45:07,394 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 91 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:07,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 39 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:45:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-25 18:45:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2021-11-25 18:45:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 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:45:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2021-11-25 18:45:07,398 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2021-11-25 18:45:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:07,399 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2021-11-25 18:45:07,399 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:45:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2021-11-25 18:45:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 18:45:07,404 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:07,404 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 3, 2, 2, 1, 1] [2021-11-25 18:45:07,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:07,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 18:45:07,608 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 486873334, now seen corresponding path program 2 times [2021-11-25 18:45:07,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:07,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056337302] [2021-11-25 18:45:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:07,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-25 18:45:07,745 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056337302] [2021-11-25 18:45:07,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056337302] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942594275] [2021-11-25 18:45:07,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:07,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:07,746 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:07,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 18:45:07,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 18:45:07,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:07,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-25 18:45:07,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:07,839 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:45:07,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 [2021-11-25 18:45:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-25 18:45:08,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-25 18:45:08,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942594275] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:08,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1784118893] [2021-11-25 18:45:08,463 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:08,463 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:08,463 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:08,463 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:08,463 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:08,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:08,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, 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:45:08,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:08,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:08,648 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 230 treesize of output 232 [2021-11-25 18:45:08,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:08,736 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:45:08,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:08,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:45:08,874 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:45:08,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:45:08,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:08,969 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 116 treesize of output 118 [2021-11-25 18:45:09,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:45:09,035 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:45:09,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:09,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:09,122 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 116 treesize of output 118 [2021-11-25 18:45:09,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:09,204 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:09,541 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2987#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:09,541 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:09,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:09,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2021-11-25 18:45:09,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687751665] [2021-11-25 18:45:09,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:09,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 18:45:09,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:09,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 18:45:09,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:45:09,544 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:10,078 INFO L93 Difference]: Finished difference Result 182 states and 214 transitions. [2021-11-25 18:45:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 18:45:10,078 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-25 18:45:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:10,079 INFO L225 Difference]: With dead ends: 182 [2021-11-25 18:45:10,079 INFO L226 Difference]: Without dead ends: 182 [2021-11-25 18:45:10,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:45:10,081 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 306 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:10,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 29 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:45:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-25 18:45:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 73. [2021-11-25 18:45:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 72 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:45:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2021-11-25 18:45:10,085 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 38 [2021-11-25 18:45:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:10,086 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2021-11-25 18:45:10,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2021-11-25 18:45:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-25 18:45:10,087 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:10,088 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-11-25 18:45:10,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:10,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 18:45:10,304 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1860620851, now seen corresponding path program 1 times [2021-11-25 18:45:10,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:10,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017849647] [2021-11-25 18:45:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:10,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:10,436 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:45:10,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017849647] [2021-11-25 18:45:10,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017849647] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981454573] [2021-11-25 18:45:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:10,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:10,444 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:10,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 18:45:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:10,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:45:10,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:10,682 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:45:10,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:10,775 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:45:10,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981454573] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:10,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1260390715] [2021-11-25 18:45:10,781 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-25 18:45:10,782 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:10,782 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:10,782 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:10,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:10,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:10,800 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:45:10,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:10,927 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:10,928 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 227 treesize of output 233 [2021-11-25 18:45:11,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:11,034 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:45:11,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:11,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:45:11,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:45:11,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:45:11,281 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:11,281 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 113 treesize of output 119 [2021-11-25 18:45:11,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:45:11,344 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:45:11,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:11,447 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:11,447 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 113 treesize of output 119 [2021-11-25 18:45:11,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:45:11,584 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:45:11,584 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:45:11,604 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:12,036 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3541#(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:45:12,036 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:12,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:12,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-11-25 18:45:12,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922948801] [2021-11-25 18:45:12,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:12,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:45:12,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:45:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:45:12,038 INFO L87 Difference]: Start difference. First operand 73 states and 88 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:45:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:12,217 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2021-11-25 18:45:12,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:45:12,218 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:45:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:12,219 INFO L225 Difference]: With dead ends: 75 [2021-11-25 18:45:12,219 INFO L226 Difference]: Without dead ends: 75 [2021-11-25 18:45:12,219 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:45:12,220 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 52 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:12,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 9 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:45:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-25 18:45:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-11-25 18:45:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 72 states have internal predecessors, (87), 0 states have call successors, (0), 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:45:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2021-11-25 18:45:12,224 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 42 [2021-11-25 18:45:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:12,224 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2021-11-25 18:45:12,224 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:45:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2021-11-25 18:45:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-25 18:45:12,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:12,226 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 1, 1] [2021-11-25 18:45:12,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:12,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:12,432 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash 718755392, now seen corresponding path program 2 times [2021-11-25 18:45:12,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:12,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255343819] [2021-11-25 18:45:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:12,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 26 proven. 166 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-25 18:45:12,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:12,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255343819] [2021-11-25 18:45:12,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255343819] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:12,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736426216] [2021-11-25 18:45:12,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:12,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:12,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:12,527 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:12,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 18:45:12,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:45:12,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:12,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-25 18:45:12,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:12,619 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:45:12,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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-11-25 18:45:12,823 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 11 treesize of output 7 [2021-11-25 18:45:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 5 proven. 126 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-25 18:45:12,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-25 18:45:13,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736426216] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:13,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [719714001] [2021-11-25 18:45:13,004 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:13,005 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:13,005 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:13,005 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:13,005 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:13,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:13,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, 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:45:13,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:13,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:13,154 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 230 treesize of output 232 [2021-11-25 18:45:13,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:45:13,241 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:45:13,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:13,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:13,394 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:45:13,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:13,500 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:13,501 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 113 treesize of output 119 [2021-11-25 18:45:13,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:13,575 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:45:13,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 10 treesize of output 9 [2021-11-25 18:45:13,659 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:13,660 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 113 treesize of output 119 [2021-11-25 18:45:13,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:13,743 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:14,027 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3989#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 33 |ULTIMATE.start_foo_~i~0#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 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:45:14,028 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:14,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:14,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 18 [2021-11-25 18:45:14,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852790091] [2021-11-25 18:45:14,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:14,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:45:14,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:45:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:45:14,030 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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:45:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:14,869 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2021-11-25 18:45:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 18:45:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 43 [2021-11-25 18:45:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:14,871 INFO L225 Difference]: With dead ends: 114 [2021-11-25 18:45:14,871 INFO L226 Difference]: Without dead ends: 114 [2021-11-25 18:45:14,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=614, Invalid=1936, Unknown=0, NotChecked=0, Total=2550 [2021-11-25 18:45:14,873 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 397 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:14,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 6 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:45:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-25 18:45:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2021-11-25 18:45:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 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:45:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2021-11-25 18:45:14,876 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 43 [2021-11-25 18:45:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:14,877 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2021-11-25 18:45:14,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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:45:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-11-25 18:45:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 18:45:14,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:14,878 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-11-25 18:45:14,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:15,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:15,089 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:15,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash -868027189, now seen corresponding path program 2 times [2021-11-25 18:45:15,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:15,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536043984] [2021-11-25 18:45:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:15,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:15,263 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:45:15,263 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536043984] [2021-11-25 18:45:15,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536043984] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:15,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332613949] [2021-11-25 18:45:15,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:15,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:15,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:15,272 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:15,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 18:45:15,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 18:45:15,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:15,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:45:15,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:15,745 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:45:15,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:45:15,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332613949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:45:15,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:45:15,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2021-11-25 18:45:15,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161307057] [2021-11-25 18:45:15,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:45:15,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:45:15,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:45:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:45:15,746 INFO L87 Difference]: Start difference. First operand 85 states and 95 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:45:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:15,749 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-11-25 18:45:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:45:15,757 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:45:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:15,758 INFO L225 Difference]: With dead ends: 86 [2021-11-25 18:45:15,758 INFO L226 Difference]: Without dead ends: 85 [2021-11-25 18:45:15,759 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:45:15,759 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:45:15,760 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:45:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-25 18:45:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-11-25 18:45:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 84 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-11-25 18:45:15,763 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 45 [2021-11-25 18:45:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:15,763 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-11-25 18:45:15,763 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:45:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-11-25 18:45:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-25 18:45:15,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:15,764 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2021-11-25 18:45:15,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:15,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-25 18:45:15,992 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1139034783, now seen corresponding path program 2 times [2021-11-25 18:45:15,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:15,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665979632] [2021-11-25 18:45:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:15,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:16,071 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:45:16,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:16,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665979632] [2021-11-25 18:45:16,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665979632] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:16,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424044020] [2021-11-25 18:45:16,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:16,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:16,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:16,073 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:16,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 18:45:16,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:45:16,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:16,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 18:45:16,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:16,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:16,168 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:45:16,170 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:45:16,409 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:45:16,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:45:16,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424044020] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:45:16,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:45:16,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2021-11-25 18:45:16,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835350350] [2021-11-25 18:45:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:45:16,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:45:16,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:16,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:45:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:45:16,410 INFO L87 Difference]: Start difference. First operand 85 states and 93 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:45:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:16,463 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-11-25 18:45:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:45:16,465 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:45:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:16,466 INFO L225 Difference]: With dead ends: 84 [2021-11-25 18:45:16,466 INFO L226 Difference]: Without dead ends: 84 [2021-11-25 18:45:16,466 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:45:16,467 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:16,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:45:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-25 18:45:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-11-25 18:45:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 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:45:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-11-25 18:45:16,470 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 46 [2021-11-25 18:45:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:16,471 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-11-25 18:45:16,471 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:45:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-11-25 18:45:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-25 18:45:16,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:16,472 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2021-11-25 18:45:16,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:16,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 18:45:16,686 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1551404259, now seen corresponding path program 2 times [2021-11-25 18:45:16,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:16,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586089512] [2021-11-25 18:45:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:16,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:16,765 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:45:16,766 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586089512] [2021-11-25 18:45:16,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586089512] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004630094] [2021-11-25 18:45:16,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:16,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:16,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:16,768 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:16,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 18:45:16,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 18:45:16,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:16,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:45:16,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:17,294 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:45:17,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:45:17,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004630094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:45:17,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:45:17,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2021-11-25 18:45:17,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132402528] [2021-11-25 18:45:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:45:17,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:45:17,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:45:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:45:17,297 INFO L87 Difference]: Start difference. First operand 84 states and 92 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:45:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:17,299 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-11-25 18:45:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:45:17,300 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:45:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:17,301 INFO L225 Difference]: With dead ends: 83 [2021-11-25 18:45:17,301 INFO L226 Difference]: Without dead ends: 72 [2021-11-25 18:45:17,301 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:45:17,302 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:45:17,302 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:45:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-25 18:45:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-25 18:45:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2021-11-25 18:45:17,305 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 49 [2021-11-25 18:45:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:17,305 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2021-11-25 18:45:17,306 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:45:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2021-11-25 18:45:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-25 18:45:17,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:17,307 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 19, 4, 3, 3, 1, 1] [2021-11-25 18:45:17,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:17,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-25 18:45:17,520 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2140007842, now seen corresponding path program 3 times [2021-11-25 18:45:17,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:17,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189151589] [2021-11-25 18:45:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:17,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 64 proven. 499 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-25 18:45:17,643 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:17,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189151589] [2021-11-25 18:45:17,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189151589] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:17,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716867980] [2021-11-25 18:45:17,644 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:45:17,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:17,645 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:17,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 18:45:17,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:45:17,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:17,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-25 18:45:17,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 183 proven. 420 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-25 18:45:18,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 183 proven. 420 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-25 18:45:18,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716867980] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:18,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717604072] [2021-11-25 18:45:18,412 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:18,412 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:18,413 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:18,413 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:18,413 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:18,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:18,428 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:45:18,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:18,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:18,565 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 230 treesize of output 232 [2021-11-25 18:45:18,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:45:18,661 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:45:18,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 10 treesize of output 9 [2021-11-25 18:45:18,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:18,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 15 treesize of output 14 [2021-11-25 18:45:18,857 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:45:18,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:18,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:18,944 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 116 treesize of output 118 [2021-11-25 18:45:18,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:45:18,999 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:45:19,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:19,100 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:19,100 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 113 treesize of output 119 [2021-11-25 18:45:19,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:19,164 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:19,503 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5631#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:19,503 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:19,503 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:19,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 33 [2021-11-25 18:45:19,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621520463] [2021-11-25 18:45:19,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:19,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-25 18:45:19,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:19,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-25 18:45:19,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1197, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:45:19,506 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 33 states have internal predecessors, (116), 0 states have call successors, (0), 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:45:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:20,680 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2021-11-25 18:45:20,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-25 18:45:20,680 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 33 states have internal predecessors, (116), 0 states have call successors, (0), 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 71 [2021-11-25 18:45:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:20,682 INFO L225 Difference]: With dead ends: 207 [2021-11-25 18:45:20,682 INFO L226 Difference]: Without dead ends: 207 [2021-11-25 18:45:20,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4010 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2647, Invalid=7453, Unknown=0, NotChecked=0, Total=10100 [2021-11-25 18:45:20,686 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:20,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 8 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:45:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-25 18:45:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2021-11-25 18:45:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.1330049261083743) internal successors, (230), 203 states have internal predecessors, (230), 0 states have call successors, (0), 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:45:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2021-11-25 18:45:20,692 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 71 [2021-11-25 18:45:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:20,693 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2021-11-25 18:45:20,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 33 states have internal predecessors, (116), 0 states have call successors, (0), 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:45:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2021-11-25 18:45:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-25 18:45:20,694 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:20,695 INFO L514 BasicCegarLoop]: trace histogram [40, 40, 39, 9, 8, 8, 1, 1] [2021-11-25 18:45:20,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:20,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:20,912 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -969958538, now seen corresponding path program 4 times [2021-11-25 18:45:20,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121980395] [2021-11-25 18:45:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:20,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1684 proven. 96 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2021-11-25 18:45:21,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121980395] [2021-11-25 18:45:21,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121980395] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987037235] [2021-11-25 18:45:21,147 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:45:21,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:21,152 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:21,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 18:45:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:21,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:45:21,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1372 proven. 154 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2021-11-25 18:45:21,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1372 proven. 154 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2021-11-25 18:45:21,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987037235] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:21,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [692590781] [2021-11-25 18:45:21,934 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:21,935 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:21,935 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:21,935 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:21,935 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:21,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:21,947 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:45:21,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:22,075 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 230 treesize of output 232 [2021-11-25 18:45:22,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,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:45:22,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,370 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:45:22,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,474 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:22,475 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 113 treesize of output 119 [2021-11-25 18:45:22,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:45:22,547 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:45:22,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,628 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:22,628 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 113 treesize of output 119 [2021-11-25 18:45:22,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:22,697 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:23,014 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7061#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:23,014 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:23,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:23,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 21 [2021-11-25 18:45:23,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001178939] [2021-11-25 18:45:23,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:23,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 18:45:23,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 18:45:23,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:45:23,016 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:45:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:23,481 INFO L93 Difference]: Finished difference Result 204 states and 224 transitions. [2021-11-25 18:45:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:45:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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) Word has length 146 [2021-11-25 18:45:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:23,483 INFO L225 Difference]: With dead ends: 204 [2021-11-25 18:45:23,484 INFO L226 Difference]: Without dead ends: 204 [2021-11-25 18:45:23,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=1700, Unknown=0, NotChecked=0, Total=2070 [2021-11-25 18:45:23,485 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:23,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:45:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-11-25 18:45:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-11-25 18:45:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.103448275862069) internal successors, (224), 203 states have internal predecessors, (224), 0 states have call successors, (0), 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:45:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 224 transitions. [2021-11-25 18:45:23,496 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 224 transitions. Word has length 146 [2021-11-25 18:45:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:23,497 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 224 transitions. [2021-11-25 18:45:23,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 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:45:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 224 transitions. [2021-11-25 18:45:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-25 18:45:23,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:23,499 INFO L514 BasicCegarLoop]: trace histogram [45, 45, 44, 9, 8, 8, 1, 1] [2021-11-25 18:45:23,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:23,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:23,712 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1399436038, now seen corresponding path program 5 times [2021-11-25 18:45:23,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:23,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074132667] [2021-11-25 18:45:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:23,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 2090 proven. 144 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2021-11-25 18:45:23,960 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074132667] [2021-11-25 18:45:23,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074132667] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:23,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319922276] [2021-11-25 18:45:23,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:23,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:23,962 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:23,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 18:45:24,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-25 18:45:24,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:24,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 18:45:24,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 644 proven. 1257 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2021-11-25 18:45:24,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 123 proven. 1778 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2021-11-25 18:45:25,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319922276] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828708244] [2021-11-25 18:45:25,556 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:25,556 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:25,556 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:25,556 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:25,556 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:25,584 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:45:25,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:25,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:25,707 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 230 treesize of output 232 [2021-11-25 18:45:25,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:25,777 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:45:25,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:25,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:25,903 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:45:25,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:45:25,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:25,980 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 116 treesize of output 118 [2021-11-25 18:45:26,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:26,042 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:45:26,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:26,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:26,114 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 116 treesize of output 118 [2021-11-25 18:45:26,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:26,189 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:26,566 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8520#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:26,566 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:26,566 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:26,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2021-11-25 18:45:26,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849473578] [2021-11-25 18:45:26,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:26,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 18:45:26,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:26,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 18:45:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2348, Unknown=0, NotChecked=0, Total=2652 [2021-11-25 18:45:26,569 INFO L87 Difference]: Start difference. First operand 204 states and 224 transitions. Second operand has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 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:45:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:27,955 INFO L93 Difference]: Finished difference Result 201 states and 215 transitions. [2021-11-25 18:45:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:45:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 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 161 [2021-11-25 18:45:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:27,957 INFO L225 Difference]: With dead ends: 201 [2021-11-25 18:45:27,958 INFO L226 Difference]: Without dead ends: 201 [2021-11-25 18:45:27,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1198, Invalid=6284, Unknown=0, NotChecked=0, Total=7482 [2021-11-25 18:45:27,961 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:27,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:45:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-11-25 18:45:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-11-25 18:45:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.075) internal successors, (215), 200 states have internal predecessors, (215), 0 states have call successors, (0), 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:45:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 215 transitions. [2021-11-25 18:45:27,977 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 215 transitions. Word has length 161 [2021-11-25 18:45:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:27,977 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 215 transitions. [2021-11-25 18:45:27,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 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:45:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 215 transitions. [2021-11-25 18:45:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-25 18:45:27,979 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:27,979 INFO L514 BasicCegarLoop]: trace histogram [49, 49, 48, 9, 8, 8, 1, 1] [2021-11-25 18:45:28,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:28,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:28,188 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1669795914, now seen corresponding path program 6 times [2021-11-25 18:45:28,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:28,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419778259] [2021-11-25 18:45:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:28,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4012 backedges. 2464 proven. 201 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2021-11-25 18:45:28,441 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:28,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419778259] [2021-11-25 18:45:28,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419778259] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:28,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979603992] [2021-11-25 18:45:28,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:45:28,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:28,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:28,444 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:28,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 18:45:28,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:45:28,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:28,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 18:45:28,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4012 backedges. 241 proven. 3493 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2021-11-25 18:45:29,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4012 backedges. 241 proven. 3493 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2021-11-25 18:45:30,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979603992] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:30,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [345482090] [2021-11-25 18:45:30,061 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:30,061 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:30,061 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:30,062 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:30,062 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:30,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:30,071 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:45:30,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:30,176 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:30,176 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 227 treesize of output 233 [2021-11-25 18:45:30,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:30,249 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:45:30,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:30,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:30,368 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:45:30,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:30,465 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:30,466 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 113 treesize of output 119 [2021-11-25 18:45:30,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:45:30,529 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:45:30,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:45:30,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:30,625 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 116 treesize of output 118 [2021-11-25 18:45:30,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:30,676 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:31,090 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10079#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:31,090 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:31,091 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:31,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 48 [2021-11-25 18:45:31,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060546555] [2021-11-25 18:45:31,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:31,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-25 18:45:31,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:31,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-25 18:45:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=2485, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 18:45:31,095 INFO L87 Difference]: Start difference. First operand 201 states and 215 transitions. Second operand has 48 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 0 states have call successors, (0), 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:45:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:34,356 INFO L93 Difference]: Finished difference Result 239 states and 249 transitions. [2021-11-25 18:45:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2021-11-25 18:45:34,358 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 0 states have call successors, (0), 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 173 [2021-11-25 18:45:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:34,360 INFO L225 Difference]: With dead ends: 239 [2021-11-25 18:45:34,360 INFO L226 Difference]: Without dead ends: 239 [2021-11-25 18:45:34,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8678 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3630, Invalid=24092, Unknown=0, NotChecked=0, Total=27722 [2021-11-25 18:45:34,371 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 367 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:34,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 0 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:45:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-25 18:45:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2021-11-25 18:45:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.0491071428571428) internal successors, (235), 224 states have internal predecessors, (235), 0 states have call successors, (0), 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:45:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 235 transitions. [2021-11-25 18:45:34,377 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 235 transitions. Word has length 173 [2021-11-25 18:45:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:34,378 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 235 transitions. [2021-11-25 18:45:34,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 0 states have call successors, (0), 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:45:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 235 transitions. [2021-11-25 18:45:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-25 18:45:34,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:34,381 INFO L514 BasicCegarLoop]: trace histogram [59, 59, 58, 10, 9, 9, 1, 1] [2021-11-25 18:45:34,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:34,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 18:45:34,592 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1369682894, now seen corresponding path program 7 times [2021-11-25 18:45:34,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:34,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987219054] [2021-11-25 18:45:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:34,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 3358 proven. 267 refuted. 0 times theorem prover too weak. 2156 trivial. 0 not checked. [2021-11-25 18:45:34,953 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:34,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987219054] [2021-11-25 18:45:34,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987219054] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:34,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751152029] [2021-11-25 18:45:34,954 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:45:34,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:34,960 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:34,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 18:45:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:35,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-25 18:45:35,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 3917 proven. 712 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2021-11-25 18:45:35,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 3917 proven. 712 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2021-11-25 18:45:36,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751152029] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:36,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1818025777] [2021-11-25 18:45:36,065 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:36,066 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:36,066 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:36,066 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:36,066 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:36,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:36,077 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:45:36,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:36,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:36,205 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 230 treesize of output 232 [2021-11-25 18:45:36,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, 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:45:36,294 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:45:36,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:36,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:36,441 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:45:36,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:36,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:36,509 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 116 treesize of output 118 [2021-11-25 18:45:36,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 15 treesize of output 14 [2021-11-25 18:45:36,564 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:45:36,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:36,693 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:36,693 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 113 treesize of output 119 [2021-11-25 18:45:36,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:36,764 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:37,154 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12039#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:37,154 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:37,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:37,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 33 [2021-11-25 18:45:37,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370432143] [2021-11-25 18:45:37,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:37,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:45:37,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:37,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:45:37,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:45:37,158 INFO L87 Difference]: Start difference. First operand 225 states and 235 transitions. Second operand has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 33 states have internal predecessors, (121), 0 states have call successors, (0), 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:45:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:38,209 INFO L93 Difference]: Finished difference Result 225 states and 231 transitions. [2021-11-25 18:45:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 18:45:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 33 states have internal predecessors, (121), 0 states have call successors, (0), 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 206 [2021-11-25 18:45:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:38,211 INFO L225 Difference]: With dead ends: 225 [2021-11-25 18:45:38,211 INFO L226 Difference]: Without dead ends: 225 [2021-11-25 18:45:38,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1117, Invalid=5525, Unknown=0, NotChecked=0, Total=6642 [2021-11-25 18:45:38,213 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:38,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:45:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-25 18:45:38,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-11-25 18:45:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.03125) internal successors, (231), 224 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:45:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 231 transitions. [2021-11-25 18:45:38,220 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 231 transitions. Word has length 206 [2021-11-25 18:45:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:38,220 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 231 transitions. [2021-11-25 18:45:38,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 33 states have internal predecessors, (121), 0 states have call successors, (0), 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:45:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 231 transitions. [2021-11-25 18:45:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-11-25 18:45:38,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:38,224 INFO L514 BasicCegarLoop]: trace histogram [62, 62, 61, 10, 9, 9, 1, 1] [2021-11-25 18:45:38,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:38,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 18:45:38,436 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash -359919582, now seen corresponding path program 8 times [2021-11-25 18:45:38,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:38,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503060601] [2021-11-25 18:45:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:38,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 3741 proven. 342 refuted. 0 times theorem prover too weak. 2265 trivial. 0 not checked. [2021-11-25 18:45:38,820 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503060601] [2021-11-25 18:45:38,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503060601] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080316357] [2021-11-25 18:45:38,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:38,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:38,824 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:38,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 18:45:39,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-25 18:45:39,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:39,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 18:45:39,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:39,076 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:45:39,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 [2021-11-25 18:45:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 1947 refuted. 0 times theorem prover too weak. 4401 trivial. 0 not checked. [2021-11-25 18:45:40,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 1947 refuted. 0 times theorem prover too weak. 4401 trivial. 0 not checked. [2021-11-25 18:45:41,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080316357] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1938953333] [2021-11-25 18:45:41,727 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:41,727 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:41,737 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:41,737 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:41,737 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:41,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:41,749 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:45:41,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:41,894 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:41,895 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 227 treesize of output 233 [2021-11-25 18:45:41,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:41,999 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:45:42,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:42,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:45:42,168 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:45:42,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:42,266 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:42,267 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 113 treesize of output 119 [2021-11-25 18:45:42,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:42,326 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:45:42,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:42,402 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:42,402 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 113 treesize of output 119 [2021-11-25 18:45:42,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:45:42,463 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:42,827 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13913#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:42,828 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:42,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:42,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 47 [2021-11-25 18:45:42,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613710270] [2021-11-25 18:45:42,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:42,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:45:42,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:42,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:45:42,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2021-11-25 18:45:42,830 INFO L87 Difference]: Start difference. First operand 225 states and 231 transitions. Second operand has 47 states, 47 states have (on average 3.148936170212766) internal successors, (148), 47 states have internal predecessors, (148), 0 states have call successors, (0), 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:45:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:45,640 INFO L93 Difference]: Finished difference Result 287 states and 302 transitions. [2021-11-25 18:45:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-11-25 18:45:45,641 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.148936170212766) internal successors, (148), 47 states have internal predecessors, (148), 0 states have call successors, (0), 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 215 [2021-11-25 18:45:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:45,643 INFO L225 Difference]: With dead ends: 287 [2021-11-25 18:45:45,643 INFO L226 Difference]: Without dead ends: 287 [2021-11-25 18:45:45,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4016 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2798, Invalid=12208, Unknown=0, NotChecked=0, Total=15006 [2021-11-25 18:45:45,646 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:45,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:45:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-25 18:45:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 261. [2021-11-25 18:45:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.0615384615384615) internal successors, (276), 260 states have internal predecessors, (276), 0 states have call successors, (0), 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:45:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 276 transitions. [2021-11-25 18:45:45,652 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 276 transitions. Word has length 215 [2021-11-25 18:45:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:45,653 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 276 transitions. [2021-11-25 18:45:45,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.148936170212766) internal successors, (148), 47 states have internal predecessors, (148), 0 states have call successors, (0), 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:45:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 276 transitions. [2021-11-25 18:45:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-11-25 18:45:45,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:45,657 INFO L514 BasicCegarLoop]: trace histogram [76, 76, 75, 10, 9, 9, 1, 1] [2021-11-25 18:45:45,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:45,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 18:45:45,872 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1914481610, now seen corresponding path program 9 times [2021-11-25 18:45:45,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:45,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820054993] [2021-11-25 18:45:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:45,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9351 backedges. 6429 proven. 1759 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2021-11-25 18:45:46,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:46,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820054993] [2021-11-25 18:45:46,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820054993] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:46,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756651892] [2021-11-25 18:45:46,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:45:46,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:46,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:46,253 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:46,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 18:45:47,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:45:47,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:47,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-25 18:45:47,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9351 backedges. 6759 proven. 1429 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2021-11-25 18:45:47,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9351 backedges. 6759 proven. 1429 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2021-11-25 18:45:48,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756651892] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:48,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [789708275] [2021-11-25 18:45:48,050 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:48,050 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:48,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:48,051 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:48,051 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:48,081 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:45:48,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:48,229 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:48,230 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 227 treesize of output 233 [2021-11-25 18:45:48,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:48,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 11 treesize of output 7 [2021-11-25 18:45:48,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:48,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:45:48,484 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:45:48,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:48,568 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:48,569 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 113 treesize of output 119 [2021-11-25 18:45:48,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:48,662 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:45:48,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:48,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:48,730 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 116 treesize of output 118 [2021-11-25 18:45:48,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:45:48,782 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:49,077 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16177#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:49,077 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:49,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:49,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 32 [2021-11-25 18:45:49,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488437044] [2021-11-25 18:45:49,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:49,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:45:49,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:45:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:45:49,079 INFO L87 Difference]: Start difference. First operand 261 states and 276 transitions. Second operand has 33 states, 33 states have (on average 3.757575757575758) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 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:45:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:50,039 INFO L93 Difference]: Finished difference Result 261 states and 274 transitions. [2021-11-25 18:45:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-25 18:45:50,039 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.757575757575758) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 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 257 [2021-11-25 18:45:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:50,041 INFO L225 Difference]: With dead ends: 261 [2021-11-25 18:45:50,041 INFO L226 Difference]: Without dead ends: 261 [2021-11-25 18:45:50,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2579 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=6695, Unknown=0, NotChecked=0, Total=8742 [2021-11-25 18:45:50,043 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:50,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:45:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-25 18:45:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2021-11-25 18:45:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.0538461538461539) internal successors, (274), 260 states have internal predecessors, (274), 0 states have call successors, (0), 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:45:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 274 transitions. [2021-11-25 18:45:50,050 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 274 transitions. Word has length 257 [2021-11-25 18:45:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:50,050 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 274 transitions. [2021-11-25 18:45:50,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.757575757575758) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 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:45:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 274 transitions. [2021-11-25 18:45:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2021-11-25 18:45:50,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:50,055 INFO L514 BasicCegarLoop]: trace histogram [77, 77, 76, 10, 9, 9, 1, 1] [2021-11-25 18:45:50,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:50,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:50,280 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:50,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash -621187358, now seen corresponding path program 10 times [2021-11-25 18:45:50,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:50,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825455015] [2021-11-25 18:45:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:50,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 307 proven. 8545 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-11-25 18:45:50,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:50,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825455015] [2021-11-25 18:45:50,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825455015] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:50,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772370318] [2021-11-25 18:45:50,709 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:45:50,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:50,712 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:50,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 18:45:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:51,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 18:45:51,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 2561 proven. 6291 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-11-25 18:45:51,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 2561 proven. 6291 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-11-25 18:45:52,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772370318] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:52,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [985007407] [2021-11-25 18:45:52,202 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:52,203 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:52,203 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:52,203 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:52,203 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:52,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:52,217 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:45:52,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:52,361 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:52,362 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 227 treesize of output 233 [2021-11-25 18:45:52,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:52,484 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:45:52,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 10 treesize of output 9 [2021-11-25 18:45:52,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:52,620 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:45:52,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 10 treesize of output 9 [2021-11-25 18:45:52,721 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:45:52,721 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 113 treesize of output 119 [2021-11-25 18:45:52,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, 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:45:52,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:45:52,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:52,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 118 [2021-11-25 18:45:52,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45:52,958 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:45:53,325 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18407#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:45:53,325 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:45:53,326 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:53,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 37 [2021-11-25 18:45:53,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518961903] [2021-11-25 18:45:53,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:53,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 18:45:53,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 18:45:53,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1506, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:45:53,328 INFO L87 Difference]: Start difference. First operand 261 states and 274 transitions. Second operand has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 0 states have call successors, (0), 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:45:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:54,851 INFO L93 Difference]: Finished difference Result 301 states and 315 transitions. [2021-11-25 18:45:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-11-25 18:45:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 0 states have call successors, (0), 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 260 [2021-11-25 18:45:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:54,854 INFO L225 Difference]: With dead ends: 301 [2021-11-25 18:45:54,854 INFO L226 Difference]: Without dead ends: 301 [2021-11-25 18:45:54,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 759 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5746 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3710, Invalid=12802, Unknown=0, NotChecked=0, Total=16512 [2021-11-25 18:45:54,857 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:54,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 7 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:45:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-25 18:45:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-11-25 18:45:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.0506756756756757) internal successors, (311), 296 states have internal predecessors, (311), 0 states have call successors, (0), 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:45:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 311 transitions. [2021-11-25 18:45:54,864 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 311 transitions. Word has length 260 [2021-11-25 18:45:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:54,865 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 311 transitions. [2021-11-25 18:45:54,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 0 states have call successors, (0), 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:45:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 311 transitions. [2021-11-25 18:45:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-11-25 18:45:54,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:54,867 INFO L514 BasicCegarLoop]: trace histogram [87, 87, 86, 11, 10, 10, 1, 1] [2021-11-25 18:45:54,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:55,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:55,072 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:45:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2087187658, now seen corresponding path program 11 times [2021-11-25 18:45:55,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:55,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477697824] [2021-11-25 18:45:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:55,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12238 backedges. 8607 proven. 2323 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2021-11-25 18:45:55,518 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:55,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477697824] [2021-11-25 18:45:55,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477697824] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:55,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079126802] [2021-11-25 18:45:55,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:55,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:55,520 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:55,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 18:45:55,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2021-11-25 18:45:55,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:55,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-25 18:45:55,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:55,850 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:45:55,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 [2021-11-25 18:45:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12238 backedges. 1792 proven. 4835 refuted. 0 times theorem prover too weak. 5611 trivial. 0 not checked. [2021-11-25 18:45:57,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12238 backedges. 0 proven. 6627 refuted. 0 times theorem prover too weak. 5611 trivial. 0 not checked. [2021-11-25 18:45:59,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079126802] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:59,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [97175342] [2021-11-25 18:45:59,918 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:45:59,918 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:45:59,918 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:45:59,918 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:45:59,918 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:45:59,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:59,927 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:45:59,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:00,072 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:00,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 227 treesize of output 233 [2021-11-25 18:46:00,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:46:00,145 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:46:00,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 10 treesize of output 9 [2021-11-25 18:46:00,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:00,303 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:46:00,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:00,385 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:00,385 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 113 treesize of output 119 [2021-11-25 18:46:00,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:00,445 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:46:00,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:00,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:00,553 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 116 treesize of output 118 [2021-11-25 18:46:00,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:00,619 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:46:00,980 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '20990#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:46:00,980 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:46:00,980 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:46:00,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 56 [2021-11-25 18:46:00,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285999998] [2021-11-25 18:46:00,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:46:00,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-25 18:46:00,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:46:00,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-25 18:46:00,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=3305, Unknown=0, NotChecked=0, Total=3906 [2021-11-25 18:46:00,983 INFO L87 Difference]: Start difference. First operand 297 states and 311 transitions. Second operand has 57 states, 57 states have (on average 3.280701754385965) internal successors, (187), 56 states have internal predecessors, (187), 0 states have call successors, (0), 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:46:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:46:12,597 INFO L93 Difference]: Finished difference Result 447 states and 483 transitions. [2021-11-25 18:46:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2021-11-25 18:46:12,597 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.280701754385965) internal successors, (187), 56 states have internal predecessors, (187), 0 states have call successors, (0), 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 293 [2021-11-25 18:46:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:46:12,601 INFO L225 Difference]: With dead ends: 447 [2021-11-25 18:46:12,601 INFO L226 Difference]: Without dead ends: 447 [2021-11-25 18:46:12,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1091 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21690 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=12761, Invalid=52009, Unknown=0, NotChecked=0, Total=64770 [2021-11-25 18:46:12,607 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 765 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:46:12,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 0 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:46:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-11-25 18:46:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 402. [2021-11-25 18:46:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 1.0648379052369077) internal successors, (427), 401 states have internal predecessors, (427), 0 states have call successors, (0), 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:46:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 427 transitions. [2021-11-25 18:46:12,622 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 427 transitions. Word has length 293 [2021-11-25 18:46:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:46:12,623 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 427 transitions. [2021-11-25 18:46:12,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.280701754385965) internal successors, (187), 56 states have internal predecessors, (187), 0 states have call successors, (0), 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:46:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 427 transitions. [2021-11-25 18:46:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-11-25 18:46:12,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:46:12,626 INFO L514 BasicCegarLoop]: trace histogram [121, 121, 120, 13, 12, 12, 1, 1] [2021-11-25 18:46:12,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 18:46:12,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-25 18:46:12,852 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:46:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:46:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1746148366, now seen corresponding path program 12 times [2021-11-25 18:46:12,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:46:12,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054031783] [2021-11-25 18:46:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:46:12,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:46:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:46:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 23442 backedges. 16707 proven. 2993 refuted. 0 times theorem prover too weak. 3742 trivial. 0 not checked. [2021-11-25 18:46:13,320 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:46:13,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054031783] [2021-11-25 18:46:13,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054031783] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:46:13,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449423821] [2021-11-25 18:46:13,321 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:46:13,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:46:13,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:46:13,341 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:46:13,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 18:46:15,014 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:46:15,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:46:15,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1879 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-25 18:46:15,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:46:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 23442 backedges. 7946 proven. 13767 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2021-11-25 18:46:16,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:46:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23442 backedges. 7946 proven. 13767 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2021-11-25 18:46:18,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449423821] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:46:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1098713207] [2021-11-25 18:46:18,028 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:46:18,028 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:46:18,028 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:46:18,028 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:46:18,028 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:46:18,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:18,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, 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:46:18,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:18,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:18,155 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 230 treesize of output 232 [2021-11-25 18:46:18,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:46:18,268 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:46:18,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:18,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:18,392 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:46:18,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:18,477 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:18,477 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 113 treesize of output 119 [2021-11-25 18:46:18,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:18,534 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:46:18,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:18,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:18,598 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 116 treesize of output 118 [2021-11-25 18:46:18,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:18,656 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:46:19,148 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '24718#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:46:19,148 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:46:19,149 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:46:19,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 35, 35] total 88 [2021-11-25 18:46:19,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200585792] [2021-11-25 18:46:19,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:46:19,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2021-11-25 18:46:19,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:46:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2021-11-25 18:46:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1400, Invalid=7530, Unknown=0, NotChecked=0, Total=8930 [2021-11-25 18:46:19,151 INFO L87 Difference]: Start difference. First operand 402 states and 427 transitions. Second operand has 89 states, 89 states have (on average 3.9213483146067416) internal successors, (349), 88 states have internal predecessors, (349), 0 states have call successors, (0), 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:46:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:46:29,668 INFO L93 Difference]: Finished difference Result 894 states and 961 transitions. [2021-11-25 18:46:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 325 states. [2021-11-25 18:46:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 3.9213483146067416) internal successors, (349), 88 states have internal predecessors, (349), 0 states have call successors, (0), 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 401 [2021-11-25 18:46:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:46:29,673 INFO L225 Difference]: With dead ends: 894 [2021-11-25 18:46:29,674 INFO L226 Difference]: Without dead ends: 894 [2021-11-25 18:46:29,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1546 GetRequests, 1131 SyntacticMatches, 1 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64950 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=20967, Invalid=151673, Unknown=0, NotChecked=0, Total=172640 [2021-11-25 18:46:29,685 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1181 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:46:29,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 0 Invalid, 5188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 4293 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 18:46:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2021-11-25 18:46:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 891. [2021-11-25 18:46:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.0764044943820226) internal successors, (958), 890 states have internal predecessors, (958), 0 states have call successors, (0), 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:46:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 958 transitions. [2021-11-25 18:46:29,704 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 958 transitions. Word has length 401 [2021-11-25 18:46:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:46:29,704 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 958 transitions. [2021-11-25 18:46:29,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 3.9213483146067416) internal successors, (349), 88 states have internal predecessors, (349), 0 states have call successors, (0), 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:46:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 958 transitions. [2021-11-25 18:46:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2021-11-25 18:46:29,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:46:29,712 INFO L514 BasicCegarLoop]: trace histogram [230, 230, 229, 22, 21, 21, 1, 1] [2021-11-25 18:46:29,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 18:46:29,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-25 18:46:29,936 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:46:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:46:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash 617893410, now seen corresponding path program 13 times [2021-11-25 18:46:29,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:46:29,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303081443] [2021-11-25 18:46:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:46:29,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:46:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:46:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 84486 backedges. 38722 proven. 732 refuted. 0 times theorem prover too weak. 45032 trivial. 0 not checked. [2021-11-25 18:46:30,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:46:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303081443] [2021-11-25 18:46:30,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303081443] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:46:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618922652] [2021-11-25 18:46:30,987 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:46:30,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:46:30,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:46:30,988 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:46:30,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 18:46:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:46:31,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 3475 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-25 18:46:31,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:46:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 84486 backedges. 49344 proven. 3202 refuted. 0 times theorem prover too weak. 31940 trivial. 0 not checked. [2021-11-25 18:46:33,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:46:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 84486 backedges. 49344 proven. 3202 refuted. 0 times theorem prover too weak. 31940 trivial. 0 not checked. [2021-11-25 18:46:34,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618922652] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:46:34,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [945396803] [2021-11-25 18:46:34,180 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:46:34,180 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:46:34,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:46:34,181 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:46:34,181 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:46:34,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:34,193 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:46:34,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:34,301 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:34,301 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 227 treesize of output 233 [2021-11-25 18:46:34,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:46:34,403 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:46:34,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:34,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:34,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:46:34,590 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:46:34,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:34,689 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:34,690 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 113 treesize of output 119 [2021-11-25 18:46:34,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:34,767 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:46:34,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:34,852 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:34,852 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 113 treesize of output 119 [2021-11-25 18:46:34,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:34,917 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:46:35,256 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '31728#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:46:35,256 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:46:35,256 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:46:35,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 26] total 53 [2021-11-25 18:46:35,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804602351] [2021-11-25 18:46:35,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:46:35,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-25 18:46:35,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:46:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-25 18:46:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=2890, Unknown=0, NotChecked=0, Total=3422 [2021-11-25 18:46:35,259 INFO L87 Difference]: Start difference. First operand 891 states and 958 transitions. Second operand has 53 states, 53 states have (on average 3.69811320754717) internal successors, (196), 53 states have internal predecessors, (196), 0 states have call successors, (0), 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:46:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:46:38,876 INFO L93 Difference]: Finished difference Result 891 states and 947 transitions. [2021-11-25 18:46:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-11-25 18:46:38,877 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.69811320754717) internal successors, (196), 53 states have internal predecessors, (196), 0 states have call successors, (0), 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 755 [2021-11-25 18:46:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:46:38,882 INFO L225 Difference]: With dead ends: 891 [2021-11-25 18:46:38,882 INFO L226 Difference]: Without dead ends: 891 [2021-11-25 18:46:38,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2396 GetRequests, 2236 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7341 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4312, Invalid=21770, Unknown=0, NotChecked=0, Total=26082 [2021-11-25 18:46:38,885 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3082 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:46:38,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 3124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3082 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:46:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-11-25 18:46:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2021-11-25 18:46:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.0640449438202246) internal successors, (947), 890 states have internal predecessors, (947), 0 states have call successors, (0), 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:46:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 947 transitions. [2021-11-25 18:46:38,902 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 947 transitions. Word has length 755 [2021-11-25 18:46:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:46:38,903 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 947 transitions. [2021-11-25 18:46:38,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.69811320754717) internal successors, (196), 53 states have internal predecessors, (196), 0 states have call successors, (0), 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:46:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 947 transitions. [2021-11-25 18:46:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2021-11-25 18:46:38,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:46:38,911 INFO L514 BasicCegarLoop]: trace histogram [239, 239, 238, 22, 21, 21, 1, 1] [2021-11-25 18:46:38,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-25 18:46:39,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-25 18:46:39,133 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:46:39,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:46:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -951918270, now seen corresponding path program 14 times [2021-11-25 18:46:39,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:46:39,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46208329] [2021-11-25 18:46:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:46:39,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:46:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:46:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 90993 backedges. 41539 proven. 852 refuted. 0 times theorem prover too weak. 48602 trivial. 0 not checked. [2021-11-25 18:46:40,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:46:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46208329] [2021-11-25 18:46:40,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46208329] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:46:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085990805] [2021-11-25 18:46:40,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:46:40,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:46:40,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:46:40,241 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:46:40,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 18:46:41,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-25 18:46:41,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:46:41,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 18:46:41,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:46:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 90993 backedges. 33903 proven. 3534 refuted. 0 times theorem prover too weak. 53556 trivial. 0 not checked. [2021-11-25 18:46:43,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:46:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 90993 backedges. 33903 proven. 3534 refuted. 0 times theorem prover too weak. 53556 trivial. 0 not checked. [2021-11-25 18:46:45,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085990805] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:46:45,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1469336251] [2021-11-25 18:46:45,662 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:46:45,662 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:46:45,662 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:46:45,662 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:46:45,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:46:45,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:45,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, 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:46:45,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:45,807 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:45,808 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 227 treesize of output 233 [2021-11-25 18:46:45,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:45,890 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:46:45,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:46,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:46,032 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:46:46,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:46:46,113 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:46:46,113 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 113 treesize of output 119 [2021-11-25 18:46:46,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:46:46,170 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:46:46,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:46,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:46,240 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 116 treesize of output 118 [2021-11-25 18:46:46,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:46:46,292 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:46:46,859 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '38520#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:46:46,859 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:46:46,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:46:46,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 42, 42] total 111 [2021-11-25 18:46:46,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085284083] [2021-11-25 18:46:46,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:46:46,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2021-11-25 18:46:46,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:46:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2021-11-25 18:46:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1880, Invalid=11692, Unknown=0, NotChecked=0, Total=13572 [2021-11-25 18:46:46,863 INFO L87 Difference]: Start difference. First operand 891 states and 947 transitions. Second operand has 111 states, 111 states have (on average 2.963963963963964) internal successors, (329), 111 states have internal predecessors, (329), 0 states have call successors, (0), 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:46:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:46:54,734 INFO L93 Difference]: Finished difference Result 1030 states and 1091 transitions. [2021-11-25 18:46:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2021-11-25 18:46:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 111 states have (on average 2.963963963963964) internal successors, (329), 111 states have internal predecessors, (329), 0 states have call successors, (0), 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 782 [2021-11-25 18:46:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:46:54,740 INFO L225 Difference]: With dead ends: 1030 [2021-11-25 18:46:54,740 INFO L226 Difference]: Without dead ends: 1030 [2021-11-25 18:46:54,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2571 GetRequests, 2261 SyntacticMatches, 0 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30109 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13326, Invalid=83706, Unknown=0, NotChecked=0, Total=97032 [2021-11-25 18:46:54,748 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1216 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 867 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 867 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:46:54,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1216 Valid, 0 Invalid, 3803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [867 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:46:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2021-11-25 18:46:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 960. [2021-11-25 18:46:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.0573514077163713) internal successors, (1014), 959 states have internal predecessors, (1014), 0 states have call successors, (0), 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:46:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1014 transitions. [2021-11-25 18:46:54,766 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1014 transitions. Word has length 782 [2021-11-25 18:46:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:46:54,767 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1014 transitions. [2021-11-25 18:46:54,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 2.963963963963964) internal successors, (329), 111 states have internal predecessors, (329), 0 states have call successors, (0), 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:46:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1014 transitions. [2021-11-25 18:46:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2021-11-25 18:46:54,774 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:46:54,775 INFO L514 BasicCegarLoop]: trace histogram [254, 254, 253, 22, 21, 21, 1, 1] [2021-11-25 18:46:54,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-25 18:46:54,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:46:54,988 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:46:54,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:46:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1184556578, now seen corresponding path program 15 times [2021-11-25 18:46:54,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:46:54,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558675142] [2021-11-25 18:46:54,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:46:54,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:46:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:46:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 102378 backedges. 53518 proven. 981 refuted. 0 times theorem prover too weak. 47879 trivial. 0 not checked. [2021-11-25 18:46:56,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:46:56,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558675142] [2021-11-25 18:46:56,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558675142] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:46:56,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597373013] [2021-11-25 18:46:56,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:46:56,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:46:56,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:46:56,152 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:46:56,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 18:47:03,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:47:03,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:47:03,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 3763 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 18:47:03,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:47:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 102378 backedges. 82604 proven. 7422 refuted. 0 times theorem prover too weak. 12352 trivial. 0 not checked. [2021-11-25 18:47:05,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:47:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 102378 backedges. 82604 proven. 7422 refuted. 0 times theorem prover too weak. 12352 trivial. 0 not checked. [2021-11-25 18:47:06,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597373013] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:47:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [722550233] [2021-11-25 18:47:06,907 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:47:06,907 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:47:06,907 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:47:06,908 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:47:06,908 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:47:06,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:06,927 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:47:06,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:07,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:07,045 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 230 treesize of output 232 [2021-11-25 18:47:07,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:47:07,121 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:47:07,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:07,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:07,248 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:47:07,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 10 treesize of output 9 [2021-11-25 18:47:07,329 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:47:07,329 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 113 treesize of output 119 [2021-11-25 18:47:07,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:07,385 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:47:07,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:07,451 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 116 treesize of output 118 [2021-11-25 18:47:07,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:07,526 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:47:07,896 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '45932#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:47:07,896 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:47:07,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:47:07,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 69 [2021-11-25 18:47:07,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355384809] [2021-11-25 18:47:07,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:47:07,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-11-25 18:47:07,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:47:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-11-25 18:47:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=898, Invalid=4652, Unknown=0, NotChecked=0, Total=5550 [2021-11-25 18:47:07,899 INFO L87 Difference]: Start difference. First operand 960 states and 1014 transitions. Second operand has 69 states, 69 states have (on average 3.9855072463768115) internal successors, (275), 69 states have internal predecessors, (275), 0 states have call successors, (0), 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:47:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:47:15,718 INFO L93 Difference]: Finished difference Result 960 states and 980 transitions. [2021-11-25 18:47:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2021-11-25 18:47:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.9855072463768115) internal successors, (275), 69 states have internal predecessors, (275), 0 states have call successors, (0), 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 827 [2021-11-25 18:47:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:47:15,722 INFO L225 Difference]: With dead ends: 960 [2021-11-25 18:47:15,722 INFO L226 Difference]: Without dead ends: 960 [2021-11-25 18:47:15,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2714 GetRequests, 2440 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22089 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=13464, Invalid=62436, Unknown=0, NotChecked=0, Total=75900 [2021-11-25 18:47:15,725 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5875 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 5875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:47:15,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 5933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 5875 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:47:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-11-25 18:47:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2021-11-25 18:47:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.0218978102189782) internal successors, (980), 959 states have internal predecessors, (980), 0 states have call successors, (0), 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:47:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 980 transitions. [2021-11-25 18:47:15,741 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 980 transitions. Word has length 827 [2021-11-25 18:47:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:47:15,742 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 980 transitions. [2021-11-25 18:47:15,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.9855072463768115) internal successors, (275), 69 states have internal predecessors, (275), 0 states have call successors, (0), 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:47:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 980 transitions. [2021-11-25 18:47:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2021-11-25 18:47:15,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:47:15,751 INFO L514 BasicCegarLoop]: trace histogram [268, 268, 267, 22, 21, 21, 1, 1] [2021-11-25 18:47:15,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 18:47:15,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-25 18:47:15,964 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:47:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:47:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1329739734, now seen corresponding path program 16 times [2021-11-25 18:47:15,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:47:15,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101848691] [2021-11-25 18:47:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:47:15,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:47:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:47:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 113613 backedges. 66911 proven. 1119 refuted. 0 times theorem prover too weak. 45583 trivial. 0 not checked. [2021-11-25 18:47:16,994 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:47:16,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101848691] [2021-11-25 18:47:16,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101848691] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:47:16,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580582048] [2021-11-25 18:47:16,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:47:16,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:47:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:47:16,999 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:47:17,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 18:47:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:47:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 3931 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-25 18:47:17,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:47:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 113613 backedges. 78192 proven. 6028 refuted. 0 times theorem prover too weak. 29393 trivial. 0 not checked. [2021-11-25 18:47:19,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:47:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 113613 backedges. 78192 proven. 6028 refuted. 0 times theorem prover too weak. 29393 trivial. 0 not checked. [2021-11-25 18:47:20,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580582048] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:47:20,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [564383133] [2021-11-25 18:47:20,724 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:47:20,724 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:47:20,725 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:47:20,725 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:47:20,725 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:47:20,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:20,736 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:47:20,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:20,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:20,832 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 230 treesize of output 232 [2021-11-25 18:47:20,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:20,923 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:47:20,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:47:21,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:21,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:21,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:47:21,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:47:21,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:21,209 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 116 treesize of output 118 [2021-11-25 18:47:21,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:21,278 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:47:21,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:21,375 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:47:21,375 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 113 treesize of output 119 [2021-11-25 18:47:21,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:21,443 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:47:21,808 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '53534#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:47:21,808 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:47:21,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:47:21,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 32] total 65 [2021-11-25 18:47:21,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720603945] [2021-11-25 18:47:21,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:47:21,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-11-25 18:47:21,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:47:21,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-11-25 18:47:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=4204, Unknown=0, NotChecked=0, Total=4970 [2021-11-25 18:47:21,812 INFO L87 Difference]: Start difference. First operand 960 states and 980 transitions. Second operand has 65 states, 65 states have (on average 3.707692307692308) internal successors, (241), 65 states have internal predecessors, (241), 0 states have call successors, (0), 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:47:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:47:27,944 INFO L93 Difference]: Finished difference Result 960 states and 977 transitions. [2021-11-25 18:47:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2021-11-25 18:47:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.707692307692308) internal successors, (241), 65 states have internal predecessors, (241), 0 states have call successors, (0), 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 869 [2021-11-25 18:47:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:47:27,949 INFO L225 Difference]: With dead ends: 960 [2021-11-25 18:47:27,949 INFO L226 Difference]: Without dead ends: 960 [2021-11-25 18:47:27,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2792 GetRequests, 2572 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13960 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8103, Invalid=40959, Unknown=0, NotChecked=0, Total=49062 [2021-11-25 18:47:27,955 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5807 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 5807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:47:27,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 5859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 5807 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 18:47:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-11-25 18:47:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2021-11-25 18:47:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.018769551616267) internal successors, (977), 959 states have internal predecessors, (977), 0 states have call successors, (0), 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:47:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 977 transitions. [2021-11-25 18:47:27,970 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 977 transitions. Word has length 869 [2021-11-25 18:47:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:47:27,971 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 977 transitions. [2021-11-25 18:47:27,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.707692307692308) internal successors, (241), 65 states have internal predecessors, (241), 0 states have call successors, (0), 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:47:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 977 transitions. [2021-11-25 18:47:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2021-11-25 18:47:27,979 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:47:27,979 INFO L514 BasicCegarLoop]: trace histogram [271, 271, 270, 22, 21, 21, 1, 1] [2021-11-25 18:47:28,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-25 18:47:28,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:47:28,192 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:47:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:47:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash -46384582, now seen corresponding path program 17 times [2021-11-25 18:47:28,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:47:28,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186071341] [2021-11-25 18:47:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:47:28,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:47:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:47:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 116097 backedges. 68831 proven. 1266 refuted. 0 times theorem prover too weak. 46000 trivial. 0 not checked. [2021-11-25 18:47:29,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:47:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186071341] [2021-11-25 18:47:29,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186071341] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:47:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557519752] [2021-11-25 18:47:29,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:47:29,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:47:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:47:29,387 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:47:29,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 18:47:30,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-25 18:47:30,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:47:30,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-25 18:47:30,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:47:30,138 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:47:30,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 [2021-11-25 18:47:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 116097 backedges. 0 proven. 18354 refuted. 0 times theorem prover too weak. 97743 trivial. 0 not checked. [2021-11-25 18:47:34,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:47:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 116097 backedges. 0 proven. 18354 refuted. 0 times theorem prover too weak. 97743 trivial. 0 not checked. [2021-11-25 18:47:40,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557519752] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:47:40,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [980468384] [2021-11-25 18:47:40,459 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:47:40,459 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:47:40,459 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:47:40,460 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:47:40,460 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:47:40,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:40,485 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:47:40,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, 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:47:40,601 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:47:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 233 [2021-11-25 18:47:40,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:40,696 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:47: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 10 treesize of output 9 [2021-11-25 18:47:40,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:40,834 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:47:40,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:40,919 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:47:40,919 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 113 treesize of output 119 [2021-11-25 18:47:40,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:47:40,982 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:47:41,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:47:41,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:47:41,100 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 116 treesize of output 118 [2021-11-25 18:47:41,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:47:41,168 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:47:41,647 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '61112#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:47:41,648 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:47:41,648 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:47:41,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 25, 25] total 87 [2021-11-25 18:47:41,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336809878] [2021-11-25 18:47:41,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:47:41,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2021-11-25 18:47:41,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:47:41,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-11-25 18:47:41,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1400, Invalid=7156, Unknown=0, NotChecked=0, Total=8556 [2021-11-25 18:47:41,651 INFO L87 Difference]: Start difference. First operand 960 states and 977 transitions. Second operand has 87 states, 87 states have (on average 3.0919540229885056) internal successors, (269), 87 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:47:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:47:46,742 INFO L93 Difference]: Finished difference Result 1046 states and 1081 transitions. [2021-11-25 18:47:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-11-25 18:47:46,742 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 3.0919540229885056) internal successors, (269), 87 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 878 [2021-11-25 18:47:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:47:46,746 INFO L225 Difference]: With dead ends: 1046 [2021-11-25 18:47:46,746 INFO L226 Difference]: Without dead ends: 1046 [2021-11-25 18:47:46,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2774 GetRequests, 2579 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9977 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=6790, Invalid=31822, Unknown=0, NotChecked=0, Total=38612 [2021-11-25 18:47:46,750 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 470 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:47:46,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 0 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 18:47:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-11-25 18:47:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 990. [2021-11-25 18:47:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.0262891809908998) internal successors, (1015), 989 states have internal predecessors, (1015), 0 states have call successors, (0), 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:47:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1015 transitions. [2021-11-25 18:47:46,766 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1015 transitions. Word has length 878 [2021-11-25 18:47:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:47:46,767 INFO L470 AbstractCegarLoop]: Abstraction has 990 states and 1015 transitions. [2021-11-25 18:47:46,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 3.0919540229885056) internal successors, (269), 87 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:47:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1015 transitions. [2021-11-25 18:47:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2021-11-25 18:47:46,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:47:46,776 INFO L514 BasicCegarLoop]: trace histogram [283, 283, 282, 22, 21, 21, 1, 1] [2021-11-25 18:47:46,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 18:47:46,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-25 18:47:46,992 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:47:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:47:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1015646830, now seen corresponding path program 18 times [2021-11-25 18:47:46,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:47:46,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839803504] [2021-11-25 18:47:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:47:46,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:47:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:47:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 126303 backedges. 94155 proven. 9743 refuted. 0 times theorem prover too weak. 22405 trivial. 0 not checked. [2021-11-25 18:47:48,220 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:47:48,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839803504] [2021-11-25 18:47:48,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839803504] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:47:48,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134479071] [2021-11-25 18:47:48,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:47:48,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:47:48,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:47:48,221 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:47:48,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 18:48:04,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:48:04,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:48:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 4111 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-25 18:48:04,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:48:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 126303 backedges. 102241 proven. 11796 refuted. 0 times theorem prover too weak. 12266 trivial. 0 not checked. [2021-11-25 18:48:06,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:48:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 126303 backedges. 102241 proven. 11796 refuted. 0 times theorem prover too weak. 12266 trivial. 0 not checked. [2021-11-25 18:48:07,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134479071] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:48:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2095953301] [2021-11-25 18:48:07,573 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:48:07,573 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:48:07,573 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:48:07,574 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:48:07,574 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:48:07,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:07,590 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:48:07,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:07,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:07,721 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 230 treesize of output 232 [2021-11-25 18:48:07,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:48:07,786 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:48:07,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:07,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:07,895 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:48:07,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:07,979 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:48:07,979 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 113 treesize of output 119 [2021-11-25 18:48:08,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:08,031 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:48:08,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:08,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:08,109 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 116 treesize of output 118 [2021-11-25 18:48:08,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:08,162 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:48:08,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '68904#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:48:08,531 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:48:08,531 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:48:08,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 40, 40] total 62 [2021-11-25 18:48:08,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519209080] [2021-11-25 18:48:08,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:48:08,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-11-25 18:48:08,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:48:08,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-11-25 18:48:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=3756, Unknown=0, NotChecked=0, Total=4692 [2021-11-25 18:48:08,535 INFO L87 Difference]: Start difference. First operand 990 states and 1015 transitions. Second operand has 63 states, 63 states have (on average 3.888888888888889) internal successors, (245), 62 states have internal predecessors, (245), 0 states have call successors, (0), 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:48:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:48:13,601 INFO L93 Difference]: Finished difference Result 990 states and 1009 transitions. [2021-11-25 18:48:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2021-11-25 18:48:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.888888888888889) internal successors, (245), 62 states have internal predecessors, (245), 0 states have call successors, (0), 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 914 [2021-11-25 18:48:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:48:13,605 INFO L225 Difference]: With dead ends: 990 [2021-11-25 18:48:13,605 INFO L226 Difference]: Without dead ends: 990 [2021-11-25 18:48:13,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2986 GetRequests, 2709 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27012 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=21178, Invalid=56384, Unknown=0, NotChecked=0, Total=77562 [2021-11-25 18:48:13,610 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:48:13,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 18:48:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2021-11-25 18:48:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2021-11-25 18:48:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.0202224469160768) internal successors, (1009), 989 states have internal predecessors, (1009), 0 states have call successors, (0), 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:48:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1009 transitions. [2021-11-25 18:48:13,624 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1009 transitions. Word has length 914 [2021-11-25 18:48:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:48:13,625 INFO L470 AbstractCegarLoop]: Abstraction has 990 states and 1009 transitions. [2021-11-25 18:48:13,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.888888888888889) internal successors, (245), 62 states have internal predecessors, (245), 0 states have call successors, (0), 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:48:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1009 transitions. [2021-11-25 18:48:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2021-11-25 18:48:13,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:48:13,634 INFO L514 BasicCegarLoop]: trace histogram [285, 285, 284, 22, 21, 21, 1, 1] [2021-11-25 18:48:13,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 18:48:13,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-25 18:48:13,856 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:48:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:48:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1736954910, now seen corresponding path program 19 times [2021-11-25 18:48:13,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:48:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340633424] [2021-11-25 18:48:13,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:48:13,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:48:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:48:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 128046 backedges. 1305 proven. 121050 refuted. 0 times theorem prover too weak. 5691 trivial. 0 not checked. [2021-11-25 18:48:15,458 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:48:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340633424] [2021-11-25 18:48:15,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340633424] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:48:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679904573] [2021-11-25 18:48:15,458 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:48:15,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:48:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:48:15,464 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:48:15,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 18:48:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:48:16,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 4135 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-25 18:48:16,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:48:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 128046 backedges. 8955 proven. 113400 refuted. 0 times theorem prover too weak. 5691 trivial. 0 not checked. [2021-11-25 18:48:18,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:48:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 128046 backedges. 8955 proven. 113400 refuted. 0 times theorem prover too weak. 5691 trivial. 0 not checked. [2021-11-25 18:48:20,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679904573] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:48:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [315998793] [2021-11-25 18:48:20,251 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:48:20,252 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:48:20,252 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:48:20,252 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:48:20,252 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:48:20,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:20,284 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:48:20,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:20,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:20,385 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 230 treesize of output 232 [2021-11-25 18:48:20,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:48:20,471 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:48:20,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:20,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:48:20,583 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:48:20,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:20,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:20,658 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 116 treesize of output 118 [2021-11-25 18:48:20,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:48:20,713 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:48:20,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:20,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:20,780 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 116 treesize of output 118 [2021-11-25 18:48:20,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:20,836 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:48:21,398 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '76898#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:48:21,398 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:48:21,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:48:21,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 73 [2021-11-25 18:48:21,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769511769] [2021-11-25 18:48:21,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:48:21,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2021-11-25 18:48:21,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:48:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-11-25 18:48:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1322, Invalid=4998, Unknown=0, NotChecked=0, Total=6320 [2021-11-25 18:48:21,401 INFO L87 Difference]: Start difference. First operand 990 states and 1009 transitions. Second operand has 74 states, 74 states have (on average 3.8513513513513513) internal successors, (285), 73 states have internal predecessors, (285), 0 states have call successors, (0), 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:48:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:48:29,958 INFO L93 Difference]: Finished difference Result 1480 states and 1512 transitions. [2021-11-25 18:48:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 329 states. [2021-11-25 18:48:29,959 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 3.8513513513513513) internal successors, (285), 73 states have internal predecessors, (285), 0 states have call successors, (0), 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 920 [2021-11-25 18:48:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:48:29,966 INFO L225 Difference]: With dead ends: 1480 [2021-11-25 18:48:29,966 INFO L226 Difference]: Without dead ends: 1480 [2021-11-25 18:48:29,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3130 GetRequests, 2727 SyntacticMatches, 1 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72937 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=33102, Invalid=129710, Unknown=0, NotChecked=0, Total=162812 [2021-11-25 18:48:29,980 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 210 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:48:29,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 11 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2658 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:48:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2021-11-25 18:48:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1194. [2021-11-25 18:48:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 1.021793797150042) internal successors, (1219), 1193 states have internal predecessors, (1219), 0 states have call successors, (0), 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:48:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1219 transitions. [2021-11-25 18:48:30,001 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1219 transitions. Word has length 920 [2021-11-25 18:48:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:48:30,002 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 1219 transitions. [2021-11-25 18:48:30,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 3.8513513513513513) internal successors, (285), 73 states have internal predecessors, (285), 0 states have call successors, (0), 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:48:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1219 transitions. [2021-11-25 18:48:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2021-11-25 18:48:30,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:48:30,012 INFO L514 BasicCegarLoop]: trace histogram [305, 305, 304, 23, 22, 22, 1, 1] [2021-11-25 18:48:30,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-25 18:48:30,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-25 18:48:30,240 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:48:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:48:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2139502194, now seen corresponding path program 20 times [2021-11-25 18:48:30,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:48:30,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128154898] [2021-11-25 18:48:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:48:30,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:48:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:48:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 146505 backedges. 118319 proven. 15278 refuted. 0 times theorem prover too weak. 12908 trivial. 0 not checked. [2021-11-25 18:48:31,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:48:31,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128154898] [2021-11-25 18:48:31,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128154898] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:48:31,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507199299] [2021-11-25 18:48:31,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:48:31,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:48:31,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:48:31,662 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:48:31,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-25 18:48:32,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2021-11-25 18:48:32,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:48:32,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-25 18:48:32,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:48:32,739 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:48:32,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 [2021-11-25 18:48:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 146505 backedges. 17276 proven. 28433 refuted. 0 times theorem prover too weak. 100796 trivial. 0 not checked. [2021-11-25 18:48:38,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:48:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 146505 backedges. 0 proven. 45709 refuted. 0 times theorem prover too weak. 100796 trivial. 0 not checked. [2021-11-25 18:48:45,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507199299] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:48:45,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [110236459] [2021-11-25 18:48:45,766 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:48:45,766 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:48:45,766 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:48:45,766 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:48:45,766 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:48:45,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:45,780 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:48:45,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:45,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:45,880 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 230 treesize of output 232 [2021-11-25 18:48:45,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:48:45,952 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:48:46,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:46,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:46,094 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:48:46,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:46,177 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:48:46,177 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 113 treesize of output 119 [2021-11-25 18:48:46,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:46,241 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:48:46,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:46,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:48:46,310 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 116 treesize of output 118 [2021-11-25 18:48:46,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:46,365 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:48:46,802 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '86219#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:48:46,802 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:48:46,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:48:46,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29, 29] total 100 [2021-11-25 18:48:46,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397418779] [2021-11-25 18:48:46,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:48:46,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2021-11-25 18:48:46,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:48:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2021-11-25 18:48:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1917, Invalid=9425, Unknown=0, NotChecked=0, Total=11342 [2021-11-25 18:48:46,806 INFO L87 Difference]: Start difference. First operand 1194 states and 1219 transitions. Second operand has 101 states, 101 states have (on average 3.4653465346534653) internal successors, (350), 100 states have internal predecessors, (350), 0 states have call successors, (0), 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:49:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:17,663 INFO L93 Difference]: Finished difference Result 1379 states and 1433 transitions. [2021-11-25 18:49:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 428 states. [2021-11-25 18:49:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.4653465346534653) internal successors, (350), 100 states have internal predecessors, (350), 0 states have call successors, (0), 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 983 [2021-11-25 18:49:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:17,670 INFO L225 Difference]: With dead ends: 1379 [2021-11-25 18:49:17,670 INFO L226 Difference]: Without dead ends: 1379 [2021-11-25 18:49:17,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3415 GetRequests, 2884 SyntacticMatches, 0 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96620 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=52705, Invalid=230851, Unknown=0, NotChecked=0, Total=283556 [2021-11-25 18:49:17,686 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1452 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:17,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1452 Valid, 0 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 18:49:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2021-11-25 18:49:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1236. [2021-11-25 18:49:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.0275303643724696) internal successors, (1269), 1235 states have internal predecessors, (1269), 0 states have call successors, (0), 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:49:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1269 transitions. [2021-11-25 18:49:17,706 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1269 transitions. Word has length 983 [2021-11-25 18:49:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:17,707 INFO L470 AbstractCegarLoop]: Abstraction has 1236 states and 1269 transitions. [2021-11-25 18:49:17,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.4653465346534653) internal successors, (350), 100 states have internal predecessors, (350), 0 states have call successors, (0), 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:49:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1269 transitions. [2021-11-25 18:49:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1161 [2021-11-25 18:49:17,719 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:17,720 INFO L514 BasicCegarLoop]: trace histogram [362, 362, 361, 25, 24, 24, 1, 1] [2021-11-25 18:49:17,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:17,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:17,934 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:49:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1338453030, now seen corresponding path program 21 times [2021-11-25 18:49:17,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:17,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734102625] [2021-11-25 18:49:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:17,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 205563 backedges. 164547 proven. 17503 refuted. 0 times theorem prover too weak. 23513 trivial. 0 not checked. [2021-11-25 18:49:19,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:19,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734102625] [2021-11-25 18:49:19,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734102625] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:19,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395637630] [2021-11-25 18:49:19,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:49:19,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:19,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:19,615 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:19,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 18:50:00,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:50:00,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:50:00,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 5155 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 18:50:00,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:50:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 205563 backedges. 2242 proven. 194736 refuted. 0 times theorem prover too weak. 8585 trivial. 0 not checked. [2021-11-25 18:50:04,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:50:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 205563 backedges. 2242 proven. 194736 refuted. 0 times theorem prover too weak. 8585 trivial. 0 not checked. [2021-11-25 18:50:07,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395637630] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:50:07,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1705465489] [2021-11-25 18:50:07,838 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:50:07,838 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:50:07,838 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:50:07,838 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:50:07,838 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:50:07,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:50:07,849 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:50:07,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:07,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:50:07,950 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 230 treesize of output 232 [2021-11-25 18:50:07,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:08,015 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:50:08,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:08,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:08,130 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:50:08,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:50:08,314 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:50:08,314 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 113 treesize of output 119 [2021-11-25 18:50:08,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:08,374 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:50:08,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:08,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:50:08,440 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 116 treesize of output 118 [2021-11-25 18:50:08,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:08,493 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:50:09,177 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '96788#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:50:09,177 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:50:09,177 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:50:09,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 59, 59] total 141 [2021-11-25 18:50:09,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970205973] [2021-11-25 18:50:09,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:50:09,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2021-11-25 18:50:09,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:50:09,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2021-11-25 18:50:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=18704, Unknown=0, NotChecked=0, Total=21756 [2021-11-25 18:50:09,183 INFO L87 Difference]: Start difference. First operand 1236 states and 1269 transitions. Second operand has 142 states, 142 states have (on average 4.02112676056338) internal successors, (571), 141 states have internal predecessors, (571), 0 states have call successors, (0), 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:50:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:50:39,925 INFO L93 Difference]: Finished difference Result 3538 states and 3725 transitions. [2021-11-25 18:50:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 675 states. [2021-11-25 18:50:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 142 states, 142 states have (on average 4.02112676056338) internal successors, (571), 141 states have internal predecessors, (571), 0 states have call successors, (0), 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 1160 [2021-11-25 18:50:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:50:39,937 INFO L225 Difference]: With dead ends: 3538 [2021-11-25 18:50:39,938 INFO L226 Difference]: Without dead ends: 3538 [2021-11-25 18:50:39,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4193 GetRequests, 3375 SyntacticMatches, 1 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258850 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=61962, Invalid=607980, Unknown=0, NotChecked=0, Total=669942 [2021-11-25 18:50:39,967 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2731 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14889 mSolverCounterSat, 1727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2731 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1727 IncrementalHoareTripleChecker+Valid, 14889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:50:39,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2731 Valid, 0 Invalid, 16616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1727 Valid, 14889 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2021-11-25 18:50:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2021-11-25 18:50:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 2313. [2021-11-25 18:50:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2312 states have (on average 1.0480103806228374) internal successors, (2423), 2312 states have internal predecessors, (2423), 0 states have call successors, (0), 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:50:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2423 transitions. [2021-11-25 18:50:40,008 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2423 transitions. Word has length 1160 [2021-11-25 18:50:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:50:40,009 INFO L470 AbstractCegarLoop]: Abstraction has 2313 states and 2423 transitions. [2021-11-25 18:50:40,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 142 states have (on average 4.02112676056338) internal successors, (571), 141 states have internal predecessors, (571), 0 states have call successors, (0), 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:50:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2423 transitions. [2021-11-25 18:50:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2021-11-25 18:50:40,032 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:50:40,033 INFO L514 BasicCegarLoop]: trace histogram [517, 517, 516, 32, 31, 31, 1, 1] [2021-11-25 18:50:40,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-25 18:50:40,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:50:40,260 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:50:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:50:40,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1846788026, now seen corresponding path program 22 times [2021-11-25 18:50:40,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:50:40,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103516086] [2021-11-25 18:50:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:50:40,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:50:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:50:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 417611 backedges. 172867 proven. 5599 refuted. 0 times theorem prover too weak. 239145 trivial. 0 not checked. [2021-11-25 18:50:42,916 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:50:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103516086] [2021-11-25 18:50:42,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103516086] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:50:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515374304] [2021-11-25 18:50:42,916 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:50:42,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:50:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:50:42,917 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:50:42,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-25 18:50:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:50:44,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 7239 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-25 18:50:44,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:50:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 417611 backedges. 303442 proven. 18082 refuted. 0 times theorem prover too weak. 96087 trivial. 0 not checked. [2021-11-25 18:50:47,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:50:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 417611 backedges. 303442 proven. 18082 refuted. 0 times theorem prover too weak. 96087 trivial. 0 not checked. [2021-11-25 18:50:49,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515374304] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:50:49,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [717823557] [2021-11-25 18:50:49,807 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:50:49,807 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:50:49,807 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:50:49,808 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:50:49,808 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:50:49,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:50:49,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:50:49,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:49,925 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:50:49,926 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 227 treesize of output 233 [2021-11-25 18:50:49,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:49,999 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:50:50,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:50,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:50,114 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:50:50,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:50,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:50:50,188 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 116 treesize of output 118 [2021-11-25 18:50:50,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:50,238 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:50:50,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:50,317 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:50:50,317 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 113 treesize of output 119 [2021-11-25 18:50:50,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:50:50,370 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:50:50,800 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '113951#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:50:50,800 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:50:50,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:50:50,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 46, 46] total 94 [2021-11-25 18:50:50,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097974193] [2021-11-25 18:50:50,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:50:50,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2021-11-25 18:50:50,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:50:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-11-25 18:50:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1511, Invalid=8389, Unknown=0, NotChecked=0, Total=9900 [2021-11-25 18:50:50,805 INFO L87 Difference]: Start difference. First operand 2313 states and 2423 transitions. Second operand has 94 states, 94 states have (on average 3.74468085106383) internal successors, (352), 94 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:51:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:09,773 INFO L93 Difference]: Finished difference Result 1875 states and 1929 transitions. [2021-11-25 18:51:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 325 states. [2021-11-25 18:51:09,773 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 3.74468085106383) internal successors, (352), 94 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) Word has length 1646 [2021-11-25 18:51:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:09,780 INFO L225 Difference]: With dead ends: 1875 [2021-11-25 18:51:09,780 INFO L226 Difference]: Without dead ends: 1875 [2021-11-25 18:51:09,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5310 GetRequests, 4890 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51195 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=29992, Invalid=147670, Unknown=0, NotChecked=0, Total=177662 [2021-11-25 18:51:09,790 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13229 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 13229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:09,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 13304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 13229 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-11-25 18:51:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2021-11-25 18:51:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2021-11-25 18:51:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1874 states have (on average 1.0293489861259337) internal successors, (1929), 1874 states have internal predecessors, (1929), 0 states have call successors, (0), 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:51:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1929 transitions. [2021-11-25 18:51:09,813 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1929 transitions. Word has length 1646 [2021-11-25 18:51:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:09,814 INFO L470 AbstractCegarLoop]: Abstraction has 1875 states and 1929 transitions. [2021-11-25 18:51:09,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 3.74468085106383) internal successors, (352), 94 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:51:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1929 transitions. [2021-11-25 18:51:09,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1692 [2021-11-25 18:51:09,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:09,838 INFO L514 BasicCegarLoop]: trace histogram [532, 532, 531, 32, 31, 31, 1, 1] [2021-11-25 18:51:09,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-11-25 18:51:10,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-11-25 18:51:10,064 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:51:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1638501726, now seen corresponding path program 23 times [2021-11-25 18:51:10,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:10,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051500625] [2021-11-25 18:51:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:10,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 441656 backedges. 156976 proven. 2766 refuted. 0 times theorem prover too weak. 281914 trivial. 0 not checked. [2021-11-25 18:51:12,602 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051500625] [2021-11-25 18:51:12,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051500625] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:51:12,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028260139] [2021-11-25 18:51:12,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:51:12,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:51:12,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:51:12,604 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:51:12,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-25 18:51:16,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2021-11-25 18:51:16,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:51:16,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-25 18:51:16,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:51:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 441656 backedges. 35347 proven. 97259 refuted. 0 times theorem prover too weak. 309050 trivial. 0 not checked. [2021-11-25 18:51:22,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:51:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 441656 backedges. 123620 proven. 8713 refuted. 0 times theorem prover too weak. 309323 trivial. 0 not checked. [2021-11-25 18:51:28,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028260139] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:51:28,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [234127133] [2021-11-25 18:51:28,163 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:51:28,163 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:51:28,163 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:51:28,164 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:51:28,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:51:28,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:28,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, 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:51:28,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:51:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:28,272 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 230 treesize of output 232 [2021-11-25 18:51:28,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:51:28,341 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:51:28,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:51:28,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:51:28,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:51:28,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:51:28,533 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:51:28,533 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 113 treesize of output 119 [2021-11-25 18:51:28,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:51:28,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:51:28,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:51:28,681 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:51:28,681 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 113 treesize of output 119 [2021-11-25 18:51:28,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:51:28,741 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:51:29,552 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '128672#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:51:29,552 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:51:29,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:51:29,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 67, 63] total 180 [2021-11-25 18:51:29,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398892169] [2021-11-25 18:51:29,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:51:29,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 180 states [2021-11-25 18:51:29,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:29,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2021-11-25 18:51:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4296, Invalid=30114, Unknown=0, NotChecked=0, Total=34410 [2021-11-25 18:51:29,558 INFO L87 Difference]: Start difference. First operand 1875 states and 1929 transitions. Second operand has 180 states, 180 states have (on average 2.9833333333333334) internal successors, (537), 180 states have internal predecessors, (537), 0 states have call successors, (0), 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:51:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:47,656 INFO L93 Difference]: Finished difference Result 2170 states and 2233 transitions. [2021-11-25 18:51:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 302 states. [2021-11-25 18:51:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 180 states, 180 states have (on average 2.9833333333333334) internal successors, (537), 180 states have internal predecessors, (537), 0 states have call successors, (0), 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 1691 [2021-11-25 18:51:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:47,664 INFO L225 Difference]: With dead ends: 2170 [2021-11-25 18:51:47,664 INFO L226 Difference]: Without dead ends: 2170 [2021-11-25 18:51:47,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5424 GetRequests, 4941 SyntacticMatches, 0 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72426 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=30972, Invalid=203768, Unknown=0, NotChecked=0, Total=234740 [2021-11-25 18:51:47,678 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1995 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6791 mSolverCounterSat, 1712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1712 IncrementalHoareTripleChecker+Valid, 6791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:47,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1995 Valid, 0 Invalid, 8503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1712 Valid, 6791 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-11-25 18:51:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2021-11-25 18:51:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1875. [2021-11-25 18:51:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1874 states have (on average 1.0240128068303096) internal successors, (1919), 1874 states have internal predecessors, (1919), 0 states have call successors, (0), 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:51:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1919 transitions. [2021-11-25 18:51:47,699 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1919 transitions. Word has length 1691 [2021-11-25 18:51:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:47,700 INFO L470 AbstractCegarLoop]: Abstraction has 1875 states and 1919 transitions. [2021-11-25 18:51:47,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 180 states, 180 states have (on average 2.9833333333333334) internal successors, (537), 180 states have internal predecessors, (537), 0 states have call successors, (0), 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:51:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1919 transitions. [2021-11-25 18:51:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2021-11-25 18:51:47,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:47,726 INFO L514 BasicCegarLoop]: trace histogram [545, 545, 544, 32, 31, 31, 1, 1] [2021-11-25 18:51:47,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-11-25 18:51:47,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-11-25 18:51:47,952 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:51:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -649382550, now seen corresponding path program 24 times [2021-11-25 18:51:47,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:47,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841537801] [2021-11-25 18:51:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:47,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 196112 proven. 2994 refuted. 0 times theorem prover too weak. 263935 trivial. 0 not checked. [2021-11-25 18:51:50,637 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:50,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841537801] [2021-11-25 18:51:50,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841537801] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:51:50,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077044295] [2021-11-25 18:51:50,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:51:50,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:51:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:51:50,638 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:51:50,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-25 18:52:35,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:52:35,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:52:35,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 7575 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 18:52:35,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:52:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 370181 proven. 26173 refuted. 0 times theorem prover too weak. 66687 trivial. 0 not checked. [2021-11-25 18:52:39,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:52:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 370181 proven. 26173 refuted. 0 times theorem prover too weak. 66687 trivial. 0 not checked. [2021-11-25 18:52:41,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077044295] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:52:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [159800946] [2021-11-25 18:52:41,965 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:52:41,965 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:52:41,966 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:52:41,966 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:52:41,966 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:52:41,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:41,986 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:52:42,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:52:42,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:42,083 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 230 treesize of output 232 [2021-11-25 18:52:42,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:52:42,152 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:52:42,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:52:42,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:52:42,263 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:52:42,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:52:42,346 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:52:42,346 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 113 treesize of output 119 [2021-11-25 18:52:42,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:52:42,404 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:52:42,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:52:42,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:42,473 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 116 treesize of output 118 [2021-11-25 18:52:42,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:52:42,523 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:52:42,970 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '143801#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:52:42,970 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:52:42,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:52:42,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 52, 52] total 105 [2021-11-25 18:52:42,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025054040] [2021-11-25 18:52:42,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:52:42,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2021-11-25 18:52:42,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2021-11-25 18:52:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1871, Invalid=10339, Unknown=0, NotChecked=0, Total=12210 [2021-11-25 18:52:42,975 INFO L87 Difference]: Start difference. First operand 1875 states and 1919 transitions. Second operand has 105 states, 105 states have (on average 3.723809523809524) internal successors, (391), 105 states have internal predecessors, (391), 0 states have call successors, (0), 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:53:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:07,709 INFO L93 Difference]: Finished difference Result 1875 states and 1910 transitions. [2021-11-25 18:53:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 379 states. [2021-11-25 18:53:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 3.723809523809524) internal successors, (391), 105 states have internal predecessors, (391), 0 states have call successors, (0), 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 1730 [2021-11-25 18:53:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:07,716 INFO L225 Difference]: With dead ends: 1875 [2021-11-25 18:53:07,716 INFO L226 Difference]: Without dead ends: 1875 [2021-11-25 18:53:07,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5620 GetRequests, 5135 SyntacticMatches, 0 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69325 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=39178, Invalid=197504, Unknown=0, NotChecked=0, Total=236682 [2021-11-25 18:53:07,725 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16992 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 16992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:07,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 17074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 16992 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2021-11-25 18:53:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2021-11-25 18:53:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2021-11-25 18:53:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1874 states have (on average 1.0192102454642475) internal successors, (1910), 1874 states have internal predecessors, (1910), 0 states have call successors, (0), 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:53:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1910 transitions. [2021-11-25 18:53:07,743 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1910 transitions. Word has length 1730 [2021-11-25 18:53:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:07,744 INFO L470 AbstractCegarLoop]: Abstraction has 1875 states and 1910 transitions. [2021-11-25 18:53:07,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 3.723809523809524) internal successors, (391), 105 states have internal predecessors, (391), 0 states have call successors, (0), 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:53:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1910 transitions. [2021-11-25 18:53:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1746 [2021-11-25 18:53:07,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:07,768 INFO L514 BasicCegarLoop]: trace histogram [550, 550, 549, 32, 31, 31, 1, 1] [2021-11-25 18:53:07,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-25 18:53:07,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-11-25 18:53:07,984 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:53:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1329526622, now seen corresponding path program 25 times [2021-11-25 18:53:07,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:07,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419973452] [2021-11-25 18:53:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:07,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 471401 backedges. 200554 proven. 3231 refuted. 0 times theorem prover too weak. 267616 trivial. 0 not checked. [2021-11-25 18:53:10,782 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:10,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419973452] [2021-11-25 18:53:10,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419973452] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:53:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522887189] [2021-11-25 18:53:10,783 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:53:10,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:53:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:53:10,784 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:53:10,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-25 18:53:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:12,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 7635 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-25 18:53:12,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:53:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 471401 backedges. 386887 proven. 29326 refuted. 0 times theorem prover too weak. 55188 trivial. 0 not checked. [2021-11-25 18:53:16,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:53:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 471401 backedges. 386887 proven. 29326 refuted. 0 times theorem prover too weak. 55188 trivial. 0 not checked. [2021-11-25 18:53:18,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522887189] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:53:18,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [200191750] [2021-11-25 18:53:18,748 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:53:18,748 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:53:18,749 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:53:18,749 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:53:18,749 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:53:18,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:53:18,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, 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:53:18,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 10 treesize of output 9 [2021-11-25 18:53:19,000 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:53:19,000 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 227 treesize of output 233 [2021-11-25 18:53:19,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,078 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:53:19,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,227 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:53:19,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,309 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:53:19,309 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 113 treesize of output 119 [2021-11-25 18:53:19,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,391 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:53:19,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:53:19,486 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 116 treesize of output 118 [2021-11-25 18:53:19,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,549 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:53:20,066 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '158883#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:53:20,066 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:53:20,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:53:20,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 54, 54] total 109 [2021-11-25 18:53:20,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058534727] [2021-11-25 18:53:20,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:53:20,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2021-11-25 18:53:20,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:20,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2021-11-25 18:53:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2009, Invalid=11101, Unknown=0, NotChecked=0, Total=13110 [2021-11-25 18:53:20,072 INFO L87 Difference]: Start difference. First operand 1875 states and 1910 transitions. Second operand has 109 states, 109 states have (on average 3.7247706422018347) internal successors, (406), 109 states have internal predecessors, (406), 0 states have call successors, (0), 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:53:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:48,695 INFO L93 Difference]: Finished difference Result 1875 states and 1902 transitions. [2021-11-25 18:53:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 407 states. [2021-11-25 18:53:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.7247706422018347) internal successors, (406), 109 states have internal predecessors, (406), 0 states have call successors, (0), 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 1745 [2021-11-25 18:53:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:48,702 INFO L225 Difference]: With dead ends: 1875 [2021-11-25 18:53:48,702 INFO L226 Difference]: Without dead ends: 1875 [2021-11-25 18:53:48,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5695 GetRequests, 5178 SyntacticMatches, 0 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78937 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=44513, Invalid=224329, Unknown=0, NotChecked=0, Total=268842 [2021-11-25 18:53:48,711 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21369 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 21369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:48,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 21454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 21369 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2021-11-25 18:53:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2021-11-25 18:53:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2021-11-25 18:53:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1874 states have (on average 1.0149413020277482) internal successors, (1902), 1874 states have internal predecessors, (1902), 0 states have call successors, (0), 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:53:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1902 transitions. [2021-11-25 18:53:48,732 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1902 transitions. Word has length 1745 [2021-11-25 18:53:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:48,733 INFO L470 AbstractCegarLoop]: Abstraction has 1875 states and 1902 transitions. [2021-11-25 18:53:48,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.7247706422018347) internal successors, (406), 109 states have internal predecessors, (406), 0 states have call successors, (0), 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:53:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1902 transitions. [2021-11-25 18:53:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2021-11-25 18:53:48,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:48,753 INFO L514 BasicCegarLoop]: trace histogram [554, 554, 553, 32, 31, 31, 1, 1] [2021-11-25 18:53:48,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-11-25 18:53:48,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:53:48,954 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:53:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1992458414, now seen corresponding path program 26 times [2021-11-25 18:53:48,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:48,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425178849] [2021-11-25 18:53:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:48,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 204581 proven. 3477 refuted. 0 times theorem prover too weak. 270085 trivial. 0 not checked. [2021-11-25 18:53:51,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425178849] [2021-11-25 18:53:51,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425178849] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:53:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001041202] [2021-11-25 18:53:51,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:53:51,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:53:51,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:53:51,339 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:53:51,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-25 18:53:59,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2021-11-25 18:53:59,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:53:59,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 2427 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-25 18:53:59,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:54:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 2268 proven. 181704 refuted. 0 times theorem prover too weak. 294171 trivial. 0 not checked. [2021-11-25 18:54:05,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:54:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 165795 proven. 18177 refuted. 0 times theorem prover too weak. 294171 trivial. 0 not checked. [2021-11-25 18:54:11,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001041202] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:54:11,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [830259056] [2021-11-25 18:54:11,460 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:54:11,460 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:54:11,461 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:54:11,461 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:54:11,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:54:11,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:54:11,475 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:54:11,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:11,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:54:11,573 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 230 treesize of output 232 [2021-11-25 18:54:11,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:11,638 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:54:11,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:11,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:11,749 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:54:11,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:11,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:54:11,821 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 116 treesize of output 118 [2021-11-25 18:54:11,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:54:11,871 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:54:11,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, 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:54:11,947 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:54:11,948 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 113 treesize of output 119 [2021-11-25 18:54:11,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, 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:54:12,001 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:54:12,828 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '174172#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:54:12,828 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:54:12,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:54:12,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 67, 67] total 188 [2021-11-25 18:54:12,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428968241] [2021-11-25 18:54:12,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:54:12,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 188 states [2021-11-25 18:54:12,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2021-11-25 18:54:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4420, Invalid=33022, Unknown=0, NotChecked=0, Total=37442 [2021-11-25 18:54:12,834 INFO L87 Difference]: Start difference. First operand 1875 states and 1902 transitions. Second operand has 188 states, 188 states have (on average 3.0585106382978724) internal successors, (575), 188 states have internal predecessors, (575), 0 states have call successors, (0), 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:54:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:31,344 INFO L93 Difference]: Finished difference Result 2269 states and 2301 transitions. [2021-11-25 18:54:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 314 states. [2021-11-25 18:54:31,345 INFO L78 Accepts]: Start accepts. Automaton has has 188 states, 188 states have (on average 3.0585106382978724) internal successors, (575), 188 states have internal predecessors, (575), 0 states have call successors, (0), 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 1757 [2021-11-25 18:54:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:31,352 INFO L225 Difference]: With dead ends: 2269 [2021-11-25 18:54:31,352 INFO L226 Difference]: Without dead ends: 2269 [2021-11-25 18:54:31,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5641 GetRequests, 5137 SyntacticMatches, 0 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75379 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=34242, Invalid=221288, Unknown=0, NotChecked=0, Total=255530 [2021-11-25 18:54:31,367 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2504 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6585 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2504 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 6585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:31,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2504 Valid, 0 Invalid, 8256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 6585 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-25 18:54:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2021-11-25 18:54:31,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1875. [2021-11-25 18:54:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1874 states have (on average 1.011205976520811) internal successors, (1895), 1874 states have internal predecessors, (1895), 0 states have call successors, (0), 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:54:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1895 transitions. [2021-11-25 18:54:31,387 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1895 transitions. Word has length 1757 [2021-11-25 18:54:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:31,388 INFO L470 AbstractCegarLoop]: Abstraction has 1875 states and 1895 transitions. [2021-11-25 18:54:31,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 188 states, 188 states have (on average 3.0585106382978724) internal successors, (575), 188 states have internal predecessors, (575), 0 states have call successors, (0), 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:54:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1895 transitions. [2021-11-25 18:54:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1773 [2021-11-25 18:54:31,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:31,412 INFO L514 BasicCegarLoop]: trace histogram [559, 559, 558, 32, 31, 31, 1, 1] [2021-11-25 18:54:31,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2021-11-25 18:54:31,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-11-25 18:54:31,628 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:54:31,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 675594338, now seen corresponding path program 27 times [2021-11-25 18:54:31,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:31,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611349520] [2021-11-25 18:54:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:31,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 486638 backedges. 411931 proven. 39322 refuted. 0 times theorem prover too weak. 35385 trivial. 0 not checked. [2021-11-25 18:54:34,049 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:34,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611349520] [2021-11-25 18:54:34,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611349520] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:54:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427703826] [2021-11-25 18:54:34,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:54:34,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:54:34,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:54:34,051 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:54:34,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-25 18:55:37,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:55:37,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:55:37,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 7743 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 18:55:37,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:55:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 486638 backedges. 414883 proven. 36370 refuted. 0 times theorem prover too weak. 35385 trivial. 0 not checked. [2021-11-25 18:55:41,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:55:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 486638 backedges. 414883 proven. 36370 refuted. 0 times theorem prover too weak. 35385 trivial. 0 not checked. [2021-11-25 18:55:43,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427703826] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:55:43,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1181873286] [2021-11-25 18:55:43,916 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-25 18:55:43,916 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:55:43,916 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:55:43,916 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:55:43,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:55:43,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:43,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:55:43,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:55:44,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:44,026 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 230 treesize of output 232 [2021-11-25 18:55:44,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:55:44,093 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:55:44,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:55:44,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:55:44,209 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:55:44,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:55:44,382 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:55:44,382 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 113 treesize of output 119 [2021-11-25 18:55:44,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:55:44,442 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:55:44,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 10 treesize of output 9 [2021-11-25 18:55:44,519 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-25 18:55:44,519 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 113 treesize of output 119 [2021-11-25 18:55:44,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:55:44,577 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:55:45,023 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '189663#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< |ULTIMATE.start_foo_~i~0#1| 33) (<= 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_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1)) (<= 0 |ULTIMATE.start_foo_#in~size#1|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:55:45,023 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:55:45,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:55:45,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 89 [2021-11-25 18:55:45,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700254390] [2021-11-25 18:55:45,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:55:45,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2021-11-25 18:55:45,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-11-25 18:55:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=7226, Unknown=0, NotChecked=0, Total=9120 [2021-11-25 18:55:45,028 INFO L87 Difference]: Start difference. First operand 1875 states and 1895 transitions. Second operand has 90 states, 90 states have (on average 3.922222222222222) internal successors, (353), 89 states have internal predecessors, (353), 0 states have call successors, (0), 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:55:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:58,882 INFO L93 Difference]: Finished difference Result 1875 states and 1889 transitions. [2021-11-25 18:55:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 465 states. [2021-11-25 18:55:58,883 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.922222222222222) internal successors, (353), 89 states have internal predecessors, (353), 0 states have call successors, (0), 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 1772 [2021-11-25 18:55:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:58,889 INFO L225 Difference]: With dead ends: 1875 [2021-11-25 18:55:58,890 INFO L226 Difference]: Without dead ends: 1875 [2021-11-25 18:55:58,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5807 GetRequests, 5278 SyntacticMatches, 0 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105046 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=81619, Invalid=199811, Unknown=0, NotChecked=0, Total=281430 [2021-11-25 18:55:58,908 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:58,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 18:55:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2021-11-25 18:55:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2021-11-25 18:55:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1874 states have (on average 1.0080042689434365) internal successors, (1889), 1874 states have internal predecessors, (1889), 0 states have call successors, (0), 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:55:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1889 transitions. [2021-11-25 18:55:58,931 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1889 transitions. Word has length 1772 [2021-11-25 18:55:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:58,932 INFO L470 AbstractCegarLoop]: Abstraction has 1875 states and 1889 transitions. [2021-11-25 18:55:58,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.922222222222222) internal successors, (353), 89 states have internal predecessors, (353), 0 states have call successors, (0), 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:55:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1889 transitions. [2021-11-25 18:55:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1776 [2021-11-25 18:55:59,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:59,042 INFO L514 BasicCegarLoop]: trace histogram [560, 560, 559, 32, 31, 31, 1, 1] [2021-11-25 18:55:59,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-11-25 18:55:59,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:55:59,264 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-25 18:55:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2114328226, now seen corresponding path program 28 times [2021-11-25 18:55:59,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:59,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759873292] [2021-11-25 18:55:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:59,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:56:02,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 18:56:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:56:06,913 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 18:56:06,914 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 18:56:06,915 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (7 of 8 remaining) [2021-11-25 18:56:06,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (6 of 8 remaining) [2021-11-25 18:56:06,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (5 of 8 remaining) [2021-11-25 18:56:06,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (4 of 8 remaining) [2021-11-25 18:56:06,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (3 of 8 remaining) [2021-11-25 18:56:06,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (2 of 8 remaining) [2021-11-25 18:56:06,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (1 of 8 remaining) [2021-11-25 18:56:06,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2021-11-25 18:56:06,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-25 18:56:06,921 INFO L732 BasicCegarLoop]: Path program histogram: [28, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:56:06,928 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 18:56:07,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:56:07 BoogieIcfgContainer [2021-11-25 18:56:07,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 18:56:07,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 18:56:07,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 18:56:07,607 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 18:56:07,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:44:49" (3/4) ... [2021-11-25 18:56:07,609 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 18:56:08,349 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 18:56:08,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 18:56:08,349 INFO L158 Benchmark]: Toolchain (without parser) took 679612.49ms. Allocated memory was 109.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 83.3MB in the beginning and 288.7MB in the end (delta: -205.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-25 18:56:08,350 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:56:08,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.30ms. Allocated memory is still 109.1MB. Free memory was 83.2MB in the beginning and 85.9MB in the end (delta: -2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:56:08,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.49ms. Allocated memory is still 109.1MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:56:08,350 INFO L158 Benchmark]: Boogie Preprocessor took 50.34ms. Allocated memory is still 109.1MB. Free memory was 84.2MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:56:08,350 INFO L158 Benchmark]: RCFGBuilder took 400.22ms. Allocated memory is still 109.1MB. Free memory was 83.1MB in the beginning and 71.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 18:56:08,351 INFO L158 Benchmark]: TraceAbstraction took 678070.20ms. Allocated memory was 109.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 70.5MB in the beginning and 399.8MB in the end (delta: -329.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-25 18:56:08,351 INFO L158 Benchmark]: Witness Printer took 742.71ms. Allocated memory is still 1.5GB. Free memory was 399.8MB in the beginning and 288.7MB in the end (delta: 111.1MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2021-11-25 18:56:08,352 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 79.7MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.30ms. Allocated memory is still 109.1MB. Free memory was 83.2MB in the beginning and 85.9MB in the end (delta: -2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.49ms. Allocated memory is still 109.1MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.34ms. Allocated memory is still 109.1MB. Free memory was 84.2MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.22ms. Allocated memory is still 109.1MB. Free memory was 83.1MB in the beginning and 71.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 678070.20ms. Allocated memory was 109.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 70.5MB in the beginning and 399.8MB in the end (delta: -329.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 742.71ms. Allocated memory is still 1.5GB. Free memory was 399.8MB in the beginning and 288.7MB 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]: pointer dereference may fail pointer dereference may fail 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) [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L17] COND TRUE i <= size + 1 VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L18] EXPR a[i] VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=0, b={33:0}, b={33:0}, i=1, size=0] [L17] COND TRUE i <= size + 1 VAL [\old(size)=0, b={33:0}, b={33:0}, i=1, size=0] [L18] EXPR a[i] VAL [\old(size)=0, b={33:0}, b={33:0}, i=1, size=0] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=0, b={33:0}, b={33:0}, i=2, size=0] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=1, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=3, size=1] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=2, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=4, size=2] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=3, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=5, size=3] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=4, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=6, size=4] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=5, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=7, size=5] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=6, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=8, size=6] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=7, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=9, size=7] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=8, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=10, size=8] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=9, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=11, size=9] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=10, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=12, size=10] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=11, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=13, size=11] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=12, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=14, size=12] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=13, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=15, size=13] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=14, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=16, size=14] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=15, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=17, size=15] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=16, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=18, size=16] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=17, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=19, size=17] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=18, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=20, size=18] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=19, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=21, size=19] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=20, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=22, size=20] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=21, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=23, size=21] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=22, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=24, size=22] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=23, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=25, size=23] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=24, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=26, size=24] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=25, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=27, size=25] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=26, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=28, size=26] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=27, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=29, size=27] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=28, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=30, size=28] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=29, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=31, size=29] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=30, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=32, size=30] [L17] COND FALSE !(i <= size + 1) [L20] return i; [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) [L26] i++ VAL [b={34:0}, i=31, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL foo(mask, i) [L15] char a[33]; [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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 + 1 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 TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L18] a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L18] b[i] - UnprovableResult [Line: 18]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: 677.3s, OverallIterations: 49, TraceHistogramMax: 560, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.4s, AutomataDifference: 267.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16299 SdHoareTripleChecker+Valid, 50.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16299 mSDsluCounter, 423 SdHoareTripleChecker+Invalid, 42.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 807 mSDsCounter, 11040 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121964 IncrementalHoareTripleChecker+Invalid, 133041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11040 mSolverCounterUnsat, 130 mSDtfsCounter, 121964 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69302 GetRequests, 61339 SyntacticMatches, 15 SemanticMatches, 7948 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109842 ImplicationChecksByTransitivity, 269.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2313occurred in iteration=42, InterpolantAutomatonStates: 5859, 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, 48 MinimizatonAttempts, 2951 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.9s SsaConstructionTime, 200.6s SatisfiabilityAnalysisTime, 142.6s InterpolantComputationTime, 43914 NumberOfCodeBlocks, 38955 NumberOfCodeBlocksAsserted, 279 NumberOfCheckSat, 62882 ConstructedInterpolants, 106 QuantifiedInterpolants, 197300 SizeOfPredicates, 199 NumberOfNonLiveVariables, 73229 ConjunctsInSsa, 1204 ConjunctsInUnsatCore, 125 InterpolantComputations, 12 PerfectInterpolantSequences, 10220840/11853282 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.5s, 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.4s, 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.4s, 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.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.4s, 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:56:08,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46fa37d-ed4e-4bfe-86fd-c8a8b29c74f4/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)