./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 10:22:52,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:22:52,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:22:52,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:22:52,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:22:52,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:22:52,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:22:52,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:22:52,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:22:52,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:22:52,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:22:52,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:22:52,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:22:52,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:22:52,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:22:52,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:22:52,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:22:52,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:22:52,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:22:52,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:22:52,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:22:52,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:22:52,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:22:52,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:22:52,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:22:52,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:22:52,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:22:52,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:22:52,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:22:52,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:22:52,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:22:52,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:22:52,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:22:52,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:22:52,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:22:52,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:22:52,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:22:52,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:22:52,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:22:52,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:22:52,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:22:52,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 10:22:52,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:22:52,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:22:52,323 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:22:52,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:22:52,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:22:52,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:22:52,325 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:22:52,325 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:22:52,325 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:22:52,325 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:22:52,325 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:22:52,325 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:22:52,325 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:22:52,325 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:22:52,326 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:22:52,326 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:22:52,326 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:22:52,326 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:22:52,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 10:22:52,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 10:22:52,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:22:52,327 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:22:52,327 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:22:52,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:22:52,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:22:52,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:22:52,328 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 10:22:52,328 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 10:22:52,328 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 10:22:52,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:22:52,328 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 10:22:52,328 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:22:52,328 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:22:52,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:22:52,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:22:52,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/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_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh 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 [2022-12-14 10:22:52,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:22:52,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:22:52,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:22:52,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:22:52,541 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:22:52,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2022-12-14 10:22:55,086 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:22:55,223 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:22:55,224 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2022-12-14 10:22:55,228 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/data/dc20a1746/8b7553ede2444377b8fde243401cb283/FLAGd488f78ed [2022-12-14 10:22:55,240 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/data/dc20a1746/8b7553ede2444377b8fde243401cb283 [2022-12-14 10:22:55,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:22:55,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:22:55,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:22:55,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:22:55,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:22:55,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743b1bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55, skipping insertion in model container [2022-12-14 10:22:55,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:22:55,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:22:55,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:22:55,398 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:22:55,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:22:55,425 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:22:55,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55 WrapperNode [2022-12-14 10:22:55,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:22:55,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:22:55,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:22:55,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:22:55,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,459 INFO L138 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2022-12-14 10:22:55,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:22:55,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:22:55,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:22:55,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:22:55,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:22:55,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:22:55,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:22:55,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:22:55,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (1/1) ... [2022-12-14 10:22:55,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:22:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:22:55,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:22:55,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:22:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:22:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:22:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:22:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:22:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 10:22:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:22:55,608 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:22:55,610 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:22:55,748 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:22:55,779 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:22:55,780 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 10:22:55,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:22:55 BoogieIcfgContainer [2022-12-14 10:22:55,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:22:55,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:22:55,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:22:55,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:22:55,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:22:55" (1/3) ... [2022-12-14 10:22:55,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d116690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:22:55, skipping insertion in model container [2022-12-14 10:22:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:22:55" (2/3) ... [2022-12-14 10:22:55,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d116690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:22:55, skipping insertion in model container [2022-12-14 10:22:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:22:55" (3/3) ... [2022-12-14 10:22:55,788 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-read.c [2022-12-14 10:22:55,803 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:22:55,803 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 10:22:55,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:22:55,841 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@539203a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:22:55,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 10:22:55,853 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) [2022-12-14 10:22:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 10:22:55,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:55,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 10:22:55,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 3301692, now seen corresponding path program 1 times [2022-12-14 10:22:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:55,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484473485] [2022-12-14 10:22:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484473485] [2022-12-14 10:22:56,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484473485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:22:56,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:22:56,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:22:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580072076] [2022-12-14 10:22:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:22:56,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:22:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:22:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:22:56,113 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) [2022-12-14 10:22:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:56,166 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-12-14 10:22:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:22:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 10:22:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:56,174 INFO L225 Difference]: With dead ends: 37 [2022-12-14 10:22:56,174 INFO L226 Difference]: Without dead ends: 35 [2022-12-14 10:22:56,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:22:56,178 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:22:56,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 16 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:22:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-14 10:22:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2022-12-14 10:22:56,200 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) [2022-12-14 10:22:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-12-14 10:22:56,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 4 [2022-12-14 10:22:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:56,201 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-12-14 10:22:56,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:22:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-12-14 10:22:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 10:22:56,202 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:56,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 10:22:56,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:22:56,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 3227615, now seen corresponding path program 1 times [2022-12-14 10:22:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:56,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660133735] [2022-12-14 10:22:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:56,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660133735] [2022-12-14 10:22:56,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660133735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:22:56,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:22:56,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:22:56,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903093934] [2022-12-14 10:22:56,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:22:56,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:22:56,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:56,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:22:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:22:56,255 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) [2022-12-14 10:22:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:56,284 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-12-14 10:22:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:22:56,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 10:22:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:56,285 INFO L225 Difference]: With dead ends: 37 [2022-12-14 10:22:56,286 INFO L226 Difference]: Without dead ends: 37 [2022-12-14 10:22:56,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:22:56,287 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 8 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 [2022-12-14 10:22:56,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:22:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-14 10:22:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2022-12-14 10:22:56,291 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) [2022-12-14 10:22:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-12-14 10:22:56,292 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 4 [2022-12-14 10:22:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:56,293 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-12-14 10:22:56,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:22:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-12-14 10:22:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 10:22:56,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:56,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 10:22:56,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:22:56,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 3229645, now seen corresponding path program 1 times [2022-12-14 10:22:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986254492] [2022-12-14 10:22:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:56,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986254492] [2022-12-14 10:22:56,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986254492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:22:56,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:22:56,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:22:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864802928] [2022-12-14 10:22:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:22:56,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:22:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:22:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:22:56,377 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) [2022-12-14 10:22:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:56,430 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-12-14 10:22:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:22:56,430 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 [2022-12-14 10:22:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:56,431 INFO L225 Difference]: With dead ends: 42 [2022-12-14 10:22:56,431 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 10:22:56,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:22:56,432 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:22:56,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 17 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:22:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 10:22:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2022-12-14 10:22:56,435 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) [2022-12-14 10:22:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-12-14 10:22:56,435 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 4 [2022-12-14 10:22:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:56,435 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-12-14 10:22:56,435 INFO L496 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) [2022-12-14 10:22:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-12-14 10:22:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 10:22:56,436 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:56,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 10:22:56,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:22:56,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:56,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash 100056118, now seen corresponding path program 1 times [2022-12-14 10:22:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:56,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249286169] [2022-12-14 10:22:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:56,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:56,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249286169] [2022-12-14 10:22:56,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249286169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:22:56,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:22:56,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:22:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361177104] [2022-12-14 10:22:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:22:56,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:22:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:22:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:22:56,491 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) [2022-12-14 10:22:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:56,520 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-12-14 10:22:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:22:56,520 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 [2022-12-14 10:22:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:56,521 INFO L225 Difference]: With dead ends: 22 [2022-12-14 10:22:56,521 INFO L226 Difference]: Without dead ends: 22 [2022-12-14 10:22:56,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:22:56,523 INFO L413 NwaCegarLoop]: 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 [2022-12-14 10:22:56,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:22:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-12-14 10:22:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-12-14 10:22:56,526 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) [2022-12-14 10:22:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-12-14 10:22:56,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2022-12-14 10:22:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:56,527 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-12-14 10:22:56,527 INFO L496 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) [2022-12-14 10:22:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-12-14 10:22:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 10:22:56,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:56,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 10:22:56,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:22:56,528 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 100056119, now seen corresponding path program 1 times [2022-12-14 10:22:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:56,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036685926] [2022-12-14 10:22:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:56,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036685926] [2022-12-14 10:22:56,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036685926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:22:56,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:22:56,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:22:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836028202] [2022-12-14 10:22:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:22:56,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:22:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:22:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:22:56,612 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) [2022-12-14 10:22:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:56,668 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-12-14 10:22:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:22:56,669 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 [2022-12-14 10:22:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:56,669 INFO L225 Difference]: With dead ends: 35 [2022-12-14 10:22:56,669 INFO L226 Difference]: Without dead ends: 35 [2022-12-14 10:22:56,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:22:56,671 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:22:56,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:22:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-14 10:22:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2022-12-14 10:22:56,674 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) [2022-12-14 10:22:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-12-14 10:22:56,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2022-12-14 10:22:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:56,675 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-12-14 10:22:56,675 INFO L496 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) [2022-12-14 10:22:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-12-14 10:22:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:22:56,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:56,676 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-14 10:22:56,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:22:56,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1664698474, now seen corresponding path program 1 times [2022-12-14 10:22:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:56,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124513478] [2022-12-14 10:22:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:56,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124513478] [2022-12-14 10:22:56,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124513478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:22:56,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423154586] [2022-12-14 10:22:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:56,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:22:56,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:22:56,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:22:56,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:22:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:56,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 10:22:56,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:22:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:22:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:56,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423154586] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:22:56,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325927736] [2022-12-14 10:22:56,865 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-12-14 10:22:56,865 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:22:56,869 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:22:56,874 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:22:56,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:22:56,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:22:56,933 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:22:57,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:57,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:22:57,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:57,252 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:22:57,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [325927736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:22:57,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:22:57,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 3] total 9 [2022-12-14 10:22:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399678044] [2022-12-14 10:22:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:22:57,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:22:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:57,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:22:57,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:22:57,401 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) [2022-12-14 10:22:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:57,675 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-12-14 10:22:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:22:57,676 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 [2022-12-14 10:22:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:57,676 INFO L225 Difference]: With dead ends: 30 [2022-12-14 10:22:57,676 INFO L226 Difference]: Without dead ends: 30 [2022-12-14 10:22:57,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:22:57,677 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:22:57,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:22:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-14 10:22:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-12-14 10:22:57,680 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) [2022-12-14 10:22:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-12-14 10:22:57,681 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2022-12-14 10:22:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:57,681 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-12-14 10:22:57,681 INFO L496 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) [2022-12-14 10:22:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-12-14 10:22:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:22:57,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:57,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2022-12-14 10:22:57,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:22:57,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 10:22:57,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash 66045196, now seen corresponding path program 1 times [2022-12-14 10:22:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:57,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773838118] [2022-12-14 10:22:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:57,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:57,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773838118] [2022-12-14 10:22:57,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773838118] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:22:57,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494761847] [2022-12-14 10:22:57,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:57,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:22:57,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:22:57,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:22:57,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:22:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:58,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 10:22:58,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:22:58,051 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:22:58,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:22:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:58,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:22:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:58,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494761847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:22:58,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1960437086] [2022-12-14 10:22:58,160 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-12-14 10:22:58,160 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:22:58,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:22:58,160 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:22:58,161 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:22:58,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:22:58,170 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:22:58,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:58,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:22:58,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:58,336 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:22:58,593 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '491#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |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|) (<= |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 [2022-12-14 10:22:58,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:22:58,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:22:58,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-14 10:22:58,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404560986] [2022-12-14 10:22:58,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:22:58,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:22:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:22:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:22:58,596 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:22:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:58,789 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2022-12-14 10:22:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:22:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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 [2022-12-14 10:22:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:58,791 INFO L225 Difference]: With dead ends: 100 [2022-12-14 10:22:58,791 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 10:22:58,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:22:58,792 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 156 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:22:58,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 31 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:22:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 10:22:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 47. [2022-12-14 10:22:58,798 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) [2022-12-14 10:22:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-12-14 10:22:58,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 8 [2022-12-14 10:22:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:58,799 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-12-14 10:22:58,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:22:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-12-14 10:22:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:22:58,800 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:58,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:22:58,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:22:59,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 10:22:59,001 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash -893317739, now seen corresponding path program 1 times [2022-12-14 10:22:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:59,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145690436] [2022-12-14 10:22:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:22:59,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145690436] [2022-12-14 10:22:59,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145690436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:22:59,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:22:59,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:22:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873652773] [2022-12-14 10:22:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:22:59,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:22:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:22:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:22:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:22:59,026 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) [2022-12-14 10:22:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:22:59,043 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-12-14 10:22:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:22:59,044 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 [2022-12-14 10:22:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:22:59,045 INFO L225 Difference]: With dead ends: 45 [2022-12-14 10:22:59,045 INFO L226 Difference]: Without dead ends: 45 [2022-12-14 10:22:59,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:22:59,046 INFO L413 NwaCegarLoop]: 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 [2022-12-14 10:22:59,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:22:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-14 10:22:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-12-14 10:22:59,049 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) [2022-12-14 10:22:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-12-14 10:22:59,049 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 10 [2022-12-14 10:22:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:22:59,049 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-12-14 10:22:59,050 INFO L496 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) [2022-12-14 10:22:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-12-14 10:22:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:22:59,050 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:22:59,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:22:59,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:22:59,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:22:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:22:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash -893317738, now seen corresponding path program 1 times [2022-12-14 10:22:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:22:59,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158588669] [2022-12-14 10:22:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:22:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:22:59,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:22:59,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158588669] [2022-12-14 10:22:59,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158588669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:22:59,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060027694] [2022-12-14 10:22:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:22:59,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:22:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:22:59,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:22:59,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:22:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:22:59,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 10:22:59,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:22:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:59,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:22:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:22:59,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060027694] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:22:59,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1495406775] [2022-12-14 10:22:59,212 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 10:22:59,212 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:22:59,212 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:22:59,213 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:22:59,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:22:59,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:22:59,225 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:22:59,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:22:59,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:22:59,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:22:59,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:22:59,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:22:59,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:22:59,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:22:59,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:00,011 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:00,440 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '809#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|))) (<= 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 [2022-12-14 10:23:00,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:00,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-12-14 10:23:00,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560977125] [2022-12-14 10:23:00,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:00,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 10:23:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 10:23:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-14 10:23:00,441 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) [2022-12-14 10:23:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:00,564 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-12-14 10:23:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:23:00,564 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 [2022-12-14 10:23:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:00,565 INFO L225 Difference]: With dead ends: 48 [2022-12-14 10:23:00,565 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 10:23:00,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-12-14 10:23:00,566 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 67 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:00,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 6 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 10:23:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-12-14 10:23:00,568 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) [2022-12-14 10:23:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-12-14 10:23:00,569 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 10 [2022-12-14 10:23:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:00,569 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-12-14 10:23:00,569 INFO L496 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) [2022-12-14 10:23:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-12-14 10:23:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:23:00,569 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:00,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:23:00,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 10:23:00,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:00,770 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1638117512, now seen corresponding path program 1 times [2022-12-14 10:23:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:00,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896570587] [2022-12-14 10:23:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 10:23:00,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:00,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896570587] [2022-12-14 10:23:00,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896570587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:00,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637622935] [2022-12-14 10:23:00,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:00,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:00,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:00,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:00,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:23:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:00,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 10:23:00,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:00,968 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#mask~0#1.base_18| Int) (|v_ULTIMATE.start_main_~#b~0#1.base_25| Int) (v_ArrVal_101 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_25| 1))) (and (= |c_#valid| (store (store (store .cse0 |v_ULTIMATE.start_main_~#mask~0#1.base_18| v_ArrVal_101) |v_ULTIMATE.start_main_~#b~0#1.base_25| 0) |v_ULTIMATE.start_main_~#mask~0#1.base_18| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_25|) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#mask~0#1.base_18|) 0)))) is different from true [2022-12-14 10:23:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:23:00,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:23:00,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637622935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:23:00,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:23:00,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-12-14 10:23:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369938395] [2022-12-14 10:23:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:23:00,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:23:00,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:23:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2022-12-14 10:23:00,971 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) [2022-12-14 10:23:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:00,991 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-12-14 10:23:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:23:00,992 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 [2022-12-14 10:23:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:00,992 INFO L225 Difference]: With dead ends: 47 [2022-12-14 10:23:00,992 INFO L226 Difference]: Without dead ends: 46 [2022-12-14 10:23:00,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2022-12-14 10:23:00,993 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:00,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-12-14 10:23:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-14 10:23:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-12-14 10:23:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 45 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) [2022-12-14 10:23:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-12-14 10:23:00,995 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 15 [2022-12-14 10:23:00,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:00,995 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-12-14 10:23:00,995 INFO L496 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) [2022-12-14 10:23:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-12-14 10:23:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 10:23:00,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:00,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:23:00,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 10:23:01,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 10:23:01,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash 757968995, now seen corresponding path program 1 times [2022-12-14 10:23:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:01,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227309639] [2022-12-14 10:23:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:23:01,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:01,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227309639] [2022-12-14 10:23:01,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227309639] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:01,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621809482] [2022-12-14 10:23:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:01,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:01,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:01,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:01,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 10:23:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:01,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 10:23:01,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:01,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:01,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:23:01,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:23:01,512 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:23:01,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:01,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 10:23:01,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 10:23:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:23:01,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621809482] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:01,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1144323530] [2022-12-14 10:23:01,648 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 10:23:01,648 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:01,648 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:01,648 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:01,649 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:01,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:01,664 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:01,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:01,785 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:01,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:01,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:01,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:01,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:01,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:02,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:02,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:02,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:02,120 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:02,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:02,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:02,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:02,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:02,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:02,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:02,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:23:02,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 10:23:02,433 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:03,070 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1174#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (exists ((|v_ULTIMATE.start_main_~#b~0#1.base_26| Int)) (and (<= 0 |v_ULTIMATE.start_main_~#b~0#1.base_26|) (= (select |#valid| |v_ULTIMATE.start_main_~#b~0#1.base_26|) 0))) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (not (< (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 32)) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:03,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:03,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:03,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2022-12-14 10:23:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338883165] [2022-12-14 10:23:03,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 10:23:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 10:23:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2022-12-14 10:23:03,072 INFO L87 Difference]: Start difference. First operand 46 states and 56 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) [2022-12-14 10:23:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:03,202 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-12-14 10:23:03,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:23:03,202 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 [2022-12-14 10:23:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:03,203 INFO L225 Difference]: With dead ends: 72 [2022-12-14 10:23:03,203 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 10:23:03,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-12-14 10:23:03,203 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:03,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 38 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 10:23:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-12-14 10:23:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 48 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) [2022-12-14 10:23:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-12-14 10:23:03,206 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 16 [2022-12-14 10:23:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:03,206 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-12-14 10:23:03,206 INFO L496 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) [2022-12-14 10:23:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-12-14 10:23:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 10:23:03,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:03,207 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2022-12-14 10:23:03,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 10:23:03,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:03,409 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1724382199, now seen corresponding path program 2 times [2022-12-14 10:23:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453813832] [2022-12-14 10:23:03,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:23:03,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:03,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453813832] [2022-12-14 10:23:03,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453813832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:03,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658242620] [2022-12-14 10:23:03,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:03,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:03,566 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:03,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:23:03,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:23:03,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:03,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 10:23:03,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:03,623 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:23:03,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:23:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 10:23:03,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 10:23:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658242620] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257660414] [2022-12-14 10:23:03,838 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-12-14 10:23:03,838 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:03,839 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:03,839 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:03,839 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:03,848 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:03,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:03,935 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:03,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:03,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:04,012 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:04,401 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1420#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |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|) (<= |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 [2022-12-14 10:23:04,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:04,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:04,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2022-12-14 10:23:04,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576968584] [2022-12-14 10:23:04,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:04,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 10:23:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 10:23:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:23:04,403 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:04,770 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-12-14 10:23:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:23:04,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 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 17 [2022-12-14 10:23:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:04,771 INFO L225 Difference]: With dead ends: 70 [2022-12-14 10:23:04,771 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 10:23:04,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2022-12-14 10:23:04,771 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 86 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:04,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 20 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 10:23:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2022-12-14 10:23:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 48 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) [2022-12-14 10:23:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-12-14 10:23:04,774 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 17 [2022-12-14 10:23:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:04,774 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-12-14 10:23:04,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-12-14 10:23:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:23:04,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:04,775 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1] [2022-12-14 10:23:04,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 10:23:04,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 10:23:04,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:04,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1778095948, now seen corresponding path program 1 times [2022-12-14 10:23:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510116442] [2022-12-14 10:23:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:23:05,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:05,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510116442] [2022-12-14 10:23:05,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510116442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:05,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730649246] [2022-12-14 10:23:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:05,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:05,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:05,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:05,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 10:23:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:05,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 10:23:05,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:23:05,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:23:05,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730649246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:05,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690292745] [2022-12-14 10:23:05,171 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:05,171 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:05,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:05,171 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:05,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:05,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:05,181 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:05,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:23:05,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:05,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:05,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:05,533 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:05,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:05,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:05,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:05,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:05,724 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:06,148 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1682#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (not (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33)) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:06,148 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:06,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:06,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-14 10:23:06,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641744793] [2022-12-14 10:23:06,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:06,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:23:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:06,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:23:06,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:23:06,149 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:06,244 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-12-14 10:23:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:23:06,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 10:23:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:06,245 INFO L225 Difference]: With dead ends: 119 [2022-12-14 10:23:06,245 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 10:23:06,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-14 10:23:06,246 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:06,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 43 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 10:23:06,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 66. [2022-12-14 10:23:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 65 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-12-14 10:23:06,251 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 19 [2022-12-14 10:23:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:06,251 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-12-14 10:23:06,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-12-14 10:23:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:23:06,251 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:06,252 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1] [2022-12-14 10:23:06,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 10:23:06,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 10:23:06,453 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1778093917, now seen corresponding path program 1 times [2022-12-14 10:23:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:06,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945833724] [2022-12-14 10:23:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 10:23:06,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945833724] [2022-12-14 10:23:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945833724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:06,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440781543] [2022-12-14 10:23:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:06,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:06,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:06,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:06,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 10:23:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:06,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 10:23:06,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 10:23:06,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 10:23:06,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440781543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:06,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [224285230] [2022-12-14 10:23:06,695 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:06,695 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:06,696 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:06,696 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:06,696 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:06,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:06,706 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:06,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:06,796 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:06,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:06,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:06,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:06,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:06,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:06,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:07,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:07,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:07,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:07,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:07,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:07,173 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:07,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:07,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:07,224 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:07,508 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2001#(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|) (not (<= |ULTIMATE.start_foo_~i~0#1| (+ |ULTIMATE.start_foo_~size#1| 1))) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (not (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|))) (<= 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|) (<= |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) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:07,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:07,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:07,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-14 10:23:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248805435] [2022-12-14 10:23:07,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:07,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 10:23:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:07,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 10:23:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:23:07,510 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:07,620 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-12-14 10:23:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:23:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 10:23:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:07,621 INFO L225 Difference]: With dead ends: 66 [2022-12-14 10:23:07,621 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 10:23:07,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-12-14 10:23:07,622 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:07,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 10:23:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-12-14 10:23:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-12-14 10:23:07,626 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 19 [2022-12-14 10:23:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:07,626 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-12-14 10:23:07,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-12-14 10:23:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:23:07,627 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:07,627 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1] [2022-12-14 10:23:07,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 10:23:07,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:07,828 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1424622748, now seen corresponding path program 2 times [2022-12-14 10:23:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:07,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734171289] [2022-12-14 10:23:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 10:23:08,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734171289] [2022-12-14 10:23:08,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734171289] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:08,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826822180] [2022-12-14 10:23:08,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:08,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:08,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:08,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:08,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 10:23:08,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:23:08,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:08,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 10:23:08,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:08,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:08,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 10:23:08,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 10:23:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 10:23:08,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:23:08,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826822180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:23:08,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:23:08,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2022-12-14 10:23:08,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443562716] [2022-12-14 10:23:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:23:08,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:23:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:08,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:23:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:23:08,197 INFO L87 Difference]: Start difference. First operand 66 states and 77 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) [2022-12-14 10:23:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:08,236 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-12-14 10:23:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:23:08,236 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 [2022-12-14 10:23:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:08,237 INFO L225 Difference]: With dead ends: 65 [2022-12-14 10:23:08,237 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 10:23:08,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:23:08,237 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:08,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 11 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:23:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 10:23:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-12-14 10:23:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-12-14 10:23:08,239 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 22 [2022-12-14 10:23:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:08,240 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-12-14 10:23:08,240 INFO L496 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) [2022-12-14 10:23:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-12-14 10:23:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 10:23:08,240 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:08,240 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-14 10:23:08,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 10:23:08,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 10:23:08,441 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:08,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1172226167, now seen corresponding path program 1 times [2022-12-14 10:23:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:08,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112717146] [2022-12-14 10:23:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 10:23:08,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:08,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112717146] [2022-12-14 10:23:08,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112717146] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:08,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990233864] [2022-12-14 10:23:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:08,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:08,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:08,542 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:08,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 10:23:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:08,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 10:23:08,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 10:23:08,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:08,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-12-14 10:23:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 10:23:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990233864] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1927595508] [2022-12-14 10:23:08,788 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 10:23:08,788 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:08,788 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:08,788 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:08,788 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:08,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:08,796 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:08,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:08,902 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:08,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:08,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:08,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:09,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:09,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:09,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:09,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:09,171 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:09,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:09,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:09,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:09,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:09,299 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:09,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:09,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:09,382 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:09,689 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2530#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (not (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|))) (<= 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 [2022-12-14 10:23:09,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:09,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:09,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2022-12-14 10:23:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336651541] [2022-12-14 10:23:09,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:09,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:23:09,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:09,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:23:09,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:23:09,690 INFO L87 Difference]: Start difference. First operand 65 states and 76 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) [2022-12-14 10:23:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:09,786 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-12-14 10:23:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:23:09,787 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 [2022-12-14 10:23:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:09,787 INFO L225 Difference]: With dead ends: 97 [2022-12-14 10:23:09,787 INFO L226 Difference]: Without dead ends: 97 [2022-12-14 10:23:09,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-12-14 10:23:09,788 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 87 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:09,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 35 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:23:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-14 10:23:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 70. [2022-12-14 10:23:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-12-14 10:23:09,790 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2022-12-14 10:23:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:09,791 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-12-14 10:23:09,791 INFO L496 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) [2022-12-14 10:23:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-12-14 10:23:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 10:23:09,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:09,792 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1] [2022-12-14 10:23:09,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 10:23:09,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 10:23:09,993 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2118870668, now seen corresponding path program 2 times [2022-12-14 10:23:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:09,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257922428] [2022-12-14 10:23:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 43 proven. 62 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 10:23:10,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:10,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257922428] [2022-12-14 10:23:10,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257922428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:10,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367248452] [2022-12-14 10:23:10,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:10,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:10,155 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:10,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 10:23:10,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:23:10,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:10,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 10:23:10,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-14 10:23:10,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-14 10:23:10,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367248452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:10,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1178618667] [2022-12-14 10:23:10,511 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:10,511 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:10,511 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:10,511 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:10,511 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:10,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:10,523 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:10,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:10,620 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:10,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:10,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:10,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:10,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:10,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:10,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:10,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:10,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:10,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:10,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:10,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:11,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:11,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:11,054 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:11,540 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2914#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (not (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33)) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:11,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:11,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:11,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 20 [2022-12-14 10:23:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604008369] [2022-12-14 10:23:11,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 10:23:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 10:23:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2022-12-14 10:23:11,542 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 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) [2022-12-14 10:23:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:12,055 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2022-12-14 10:23:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 10:23:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 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 31 [2022-12-14 10:23:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:12,056 INFO L225 Difference]: With dead ends: 119 [2022-12-14 10:23:12,056 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 10:23:12,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=398, Invalid=1858, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 10:23:12,058 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 234 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:12,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 22 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 10:23:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2022-12-14 10:23:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-12-14 10:23:12,060 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 31 [2022-12-14 10:23:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:12,061 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-12-14 10:23:12,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 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) [2022-12-14 10:23:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-12-14 10:23:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 10:23:12,062 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:12,062 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 3, 2, 2, 1, 1] [2022-12-14 10:23:12,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 10:23:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:12,263 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash 980260120, now seen corresponding path program 1 times [2022-12-14 10:23:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:12,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194746872] [2022-12-14 10:23:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 30 proven. 113 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 10:23:12,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:12,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194746872] [2022-12-14 10:23:12,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194746872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:12,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573924268] [2022-12-14 10:23:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:12,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:12,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:12,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 10:23:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:12,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 10:23:12,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 40 proven. 103 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 10:23:12,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 40 proven. 103 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 10:23:12,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573924268] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:12,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1377566773] [2022-12-14 10:23:12,601 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:12,601 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:12,602 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:12,602 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:12,602 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:12,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:12,611 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:12,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:12,697 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:12,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:12,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:12,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:12,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:12,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:12,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:12,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:12,951 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:12,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:12,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:12,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:13,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:13,052 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:13,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:13,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:13,096 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:13,313 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3412#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= 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|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:13,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:13,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:13,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-14 10:23:13,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847902850] [2022-12-14 10:23:13,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:13,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 10:23:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 10:23:13,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:23:13,315 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:13,557 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-12-14 10:23:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 10:23:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-14 10:23:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:13,558 INFO L225 Difference]: With dead ends: 127 [2022-12-14 10:23:13,558 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 10:23:13,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 10:23:13,559 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:13,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 21 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 10:23:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 90. [2022-12-14 10:23:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-12-14 10:23:13,561 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 38 [2022-12-14 10:23:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:13,561 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-12-14 10:23:13,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-12-14 10:23:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 10:23:13,562 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:13,562 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2022-12-14 10:23:13,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 10:23:13,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 10:23:13,763 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1534963659, now seen corresponding path program 2 times [2022-12-14 10:23:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:13,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104450060] [2022-12-14 10:23:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 87 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 10:23:13,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:13,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104450060] [2022-12-14 10:23:13,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104450060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:13,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921872480] [2022-12-14 10:23:13,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:13,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:13,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:13,919 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:13,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 10:23:13,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:23:13,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:13,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 10:23:13,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:13,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:13,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 10:23:13,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 10:23:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-12-14 10:23:14,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:23:14,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921872480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:23:14,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:23:14,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 12 [2022-12-14 10:23:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807064856] [2022-12-14 10:23:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:23:14,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:23:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:23:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-14 10:23:14,152 INFO L87 Difference]: Start difference. First operand 90 states and 101 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) [2022-12-14 10:23:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:14,178 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2022-12-14 10:23:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:23:14,178 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 43 [2022-12-14 10:23:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:14,179 INFO L225 Difference]: With dead ends: 89 [2022-12-14 10:23:14,179 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 10:23:14,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-14 10:23:14,180 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:14,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:23:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 10:23:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-14 10:23:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 88 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2022-12-14 10:23:14,182 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 43 [2022-12-14 10:23:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:14,182 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2022-12-14 10:23:14,182 INFO L496 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) [2022-12-14 10:23:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-12-14 10:23:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 10:23:14,183 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:14,183 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-14 10:23:14,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 10:23:14,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:14,385 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 414454159, now seen corresponding path program 2 times [2022-12-14 10:23:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:14,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732023663] [2022-12-14 10:23:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 16 proven. 87 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 10:23:14,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732023663] [2022-12-14 10:23:14,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732023663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643590361] [2022-12-14 10:23:14,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:14,617 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:14,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 10:23:14,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 10:23:14,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:14,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 10:23:14,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:14,886 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_400 Int) (|v_ULTIMATE.start_main_~#b~0#1.base_27| Int) (|v_ULTIMATE.start_main_~#mask~0#1.base_20| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_27| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#mask~0#1.base_20|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_27|) 0) (= |c_#valid| (store (store (store .cse0 |v_ULTIMATE.start_main_~#mask~0#1.base_20| v_ArrVal_400) |v_ULTIMATE.start_main_~#b~0#1.base_27| 0) |v_ULTIMATE.start_main_~#mask~0#1.base_20| 0))))) is different from true [2022-12-14 10:23:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-12-14 10:23:14,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:23:14,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643590361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:23:14,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:23:14,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 10 [2022-12-14 10:23:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961885283] [2022-12-14 10:23:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:23:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:23:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:14,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:23:14,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2022-12-14 10:23:14,888 INFO L87 Difference]: Start difference. First operand 89 states and 100 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) [2022-12-14 10:23:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:14,901 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-12-14 10:23:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:23:14,901 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 46 [2022-12-14 10:23:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:14,902 INFO L225 Difference]: With dead ends: 88 [2022-12-14 10:23:14,902 INFO L226 Difference]: Without dead ends: 77 [2022-12-14 10:23:14,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2022-12-14 10:23:14,902 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:14,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-12-14 10:23:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-14 10:23:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-12-14 10:23:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-12-14 10:23:14,904 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 46 [2022-12-14 10:23:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:14,904 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-12-14 10:23:14,904 INFO L496 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) [2022-12-14 10:23:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-12-14 10:23:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 10:23:14,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:14,905 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 3, 3, 1, 1] [2022-12-14 10:23:14,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 10:23:15,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:15,106 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash -734991474, now seen corresponding path program 2 times [2022-12-14 10:23:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:15,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978472065] [2022-12-14 10:23:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:15,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 151 proven. 87 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 10:23:15,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:15,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978472065] [2022-12-14 10:23:15,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978472065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:15,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174416787] [2022-12-14 10:23:15,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:15,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:15,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:15,233 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:15,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 10:23:15,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 10:23:15,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:15,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 10:23:15,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:15,345 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:23:15,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:23:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-14 10:23:15,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-14 10:23:15,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174416787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:15,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1072753387] [2022-12-14 10:23:15,723 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:15,723 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:15,723 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:15,723 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:15,723 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:15,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:15,730 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:15,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:15,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:23:15,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:15,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:15,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:15,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:15,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:15,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:15,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:16,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:16,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:16,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:16,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:16,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:16,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:16,191 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:16,629 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4620#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:16,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:16,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:16,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-14 10:23:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940962139] [2022-12-14 10:23:16,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:16,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 10:23:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:16,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 10:23:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-12-14 10:23:16,631 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:17,151 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2022-12-14 10:23:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 10:23:17,151 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 20 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 50 [2022-12-14 10:23:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:17,152 INFO L225 Difference]: With dead ends: 124 [2022-12-14 10:23:17,152 INFO L226 Difference]: Without dead ends: 124 [2022-12-14 10:23:17,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 10:23:17,153 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:17,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-14 10:23:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2022-12-14 10:23:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2022-12-14 10:23:17,157 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 50 [2022-12-14 10:23:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:17,157 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2022-12-14 10:23:17,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-12-14 10:23:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 10:23:17,158 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:17,158 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 4, 3, 3, 1, 1] [2022-12-14 10:23:17,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 10:23:17,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 10:23:17,359 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1855257505, now seen corresponding path program 3 times [2022-12-14 10:23:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:17,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387390717] [2022-12-14 10:23:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 155 proven. 448 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 10:23:17,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:17,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387390717] [2022-12-14 10:23:17,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387390717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:17,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716054609] [2022-12-14 10:23:17,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:23:17,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:17,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:17,623 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:17,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 10:23:17,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:23:17,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:17,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 10:23:17,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 183 proven. 420 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 10:23:17,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 183 proven. 420 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 10:23:18,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716054609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:18,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1421482034] [2022-12-14 10:23:18,118 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:18,118 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:18,118 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:18,118 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:18,118 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:18,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:18,128 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:18,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:18,212 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:18,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:18,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:18,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:18,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:18,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:18,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:18,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:18,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:18,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:18,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:18,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:18,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:18,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:18,597 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:19,185 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5359#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:19,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:19,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:19,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 38 [2022-12-14 10:23:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259119359] [2022-12-14 10:23:19,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:19,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 10:23:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 10:23:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 10:23:19,187 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 38 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:20,197 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2022-12-14 10:23:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-12-14 10:23:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 38 states have internal predecessors, (131), 0 states have call successors, (0), 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 [2022-12-14 10:23:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:20,199 INFO L225 Difference]: With dead ends: 218 [2022-12-14 10:23:20,199 INFO L226 Difference]: Without dead ends: 218 [2022-12-14 10:23:20,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 179 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2678, Invalid=8452, Unknown=0, NotChecked=0, Total=11130 [2022-12-14 10:23:20,201 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 99 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:20,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 7 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:23:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-14 10:23:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2022-12-14 10:23:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 203 states have (on average 1.206896551724138) internal successors, (245), 204 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) [2022-12-14 10:23:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 245 transitions. [2022-12-14 10:23:20,204 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 245 transitions. Word has length 71 [2022-12-14 10:23:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:20,205 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 245 transitions. [2022-12-14 10:23:20,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 38 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 245 transitions. [2022-12-14 10:23:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 10:23:20,205 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:20,206 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 5, 4, 4, 1, 1] [2022-12-14 10:23:20,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 10:23:20,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 10:23:20,407 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1199154910, now seen corresponding path program 3 times [2022-12-14 10:23:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:20,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042494732] [2022-12-14 10:23:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:20,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 366 proven. 191 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 10:23:20,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:20,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042494732] [2022-12-14 10:23:20,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042494732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:20,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015647064] [2022-12-14 10:23:20,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:23:20,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:20,605 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:20,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 10:23:20,719 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:23:20,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:20,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 10:23:20,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 403 proven. 154 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 10:23:20,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 403 proven. 154 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 10:23:20,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015647064] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:20,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148793310] [2022-12-14 10:23:20,961 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:20,961 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:20,961 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:20,961 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:20,961 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:20,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:20,969 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:20,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:21,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:23:21,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:21,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:21,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:21,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:21,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:21,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:21,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:21,287 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:21,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:21,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:21,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:21,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:21,393 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:21,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:21,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:21,440 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:21,675 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6364#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (not (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33)) (= |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|) (<= |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) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:21,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:21,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:21,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2022-12-14 10:23:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875362419] [2022-12-14 10:23:21,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:21,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 10:23:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 10:23:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2022-12-14 10:23:21,677 INFO L87 Difference]: Start difference. First operand 205 states and 245 transitions. Second operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:21,929 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2022-12-14 10:23:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 10:23:21,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 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 73 [2022-12-14 10:23:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:21,931 INFO L225 Difference]: With dead ends: 205 [2022-12-14 10:23:21,931 INFO L226 Difference]: Without dead ends: 205 [2022-12-14 10:23:21,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 197 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 10:23:21,932 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:21,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-14 10:23:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-12-14 10:23:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 203 states have (on average 1.1773399014778325) internal successors, (239), 204 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 239 transitions. [2022-12-14 10:23:21,937 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 239 transitions. Word has length 73 [2022-12-14 10:23:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:21,937 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 239 transitions. [2022-12-14 10:23:21,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 239 transitions. [2022-12-14 10:23:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 10:23:21,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:21,938 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 5, 4, 4, 1, 1] [2022-12-14 10:23:21,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 10:23:22,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:22,139 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1905955935, now seen corresponding path program 4 times [2022-12-14 10:23:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:22,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375152227] [2022-12-14 10:23:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 55 proven. 587 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-14 10:23:22,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:22,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375152227] [2022-12-14 10:23:22,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375152227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:22,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872005485] [2022-12-14 10:23:22,379 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:23:22,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:22,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:22,379 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:22,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 10:23:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:22,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 10:23:22,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 71 proven. 571 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-14 10:23:22,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 71 proven. 571 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-14 10:23:22,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872005485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:22,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624166678] [2022-12-14 10:23:22,744 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:22,745 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:22,745 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:22,745 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:22,745 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:22,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:22,754 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:22,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:22,840 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:22,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:22,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:22,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:22,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:22,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:23,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:23,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:23,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:23,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:23,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:23,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:23,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:23,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:23,243 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:23,665 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7281#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (not (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33)) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:23,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:23,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:23,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-12-14 10:23:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014012878] [2022-12-14 10:23:23,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:23,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 10:23:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 10:23:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2022-12-14 10:23:23,666 INFO L87 Difference]: Start difference. First operand 205 states and 239 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:24,017 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2022-12-14 10:23:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 10:23:24,018 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-12-14 10:23:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:24,019 INFO L225 Difference]: With dead ends: 204 [2022-12-14 10:23:24,019 INFO L226 Difference]: Without dead ends: 204 [2022-12-14 10:23:24,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 201 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=714, Invalid=2708, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 10:23:24,021 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 71 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:24,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 9 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-12-14 10:23:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-12-14 10:23:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 1.17) internal successors, (234), 201 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2022-12-14 10:23:24,024 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 76 [2022-12-14 10:23:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:24,025 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2022-12-14 10:23:24,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2022-12-14 10:23:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 10:23:24,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:24,025 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 6, 5, 5, 1, 1] [2022-12-14 10:23:24,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 10:23:24,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 10:23:24,227 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 980782665, now seen corresponding path program 5 times [2022-12-14 10:23:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:24,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383199107] [2022-12-14 10:23:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 640 proven. 344 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-12-14 10:23:24,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:24,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383199107] [2022-12-14 10:23:24,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383199107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:24,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421100041] [2022-12-14 10:23:24,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:24,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:24,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:24,559 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:24,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 10:23:24,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:23:24,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:24,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 10:23:24,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:24,647 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:23:24,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:23:24,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-12-14 10:23:24,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-12-14 10:23:25,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421100041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:25,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [277516129] [2022-12-14 10:23:25,262 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:25,262 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:25,262 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:25,262 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:25,262 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:25,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:25,271 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:25,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:25,350 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:25,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:25,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:25,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:25,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:25,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:25,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:25,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:25,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:25,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:25,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:25,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:25,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:25,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:25,732 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:26,096 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8330#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (not (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33)) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:26,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:26,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:26,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 3, 3] total 18 [2022-12-14 10:23:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705127198] [2022-12-14 10:23:26,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:26,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 10:23:26,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 10:23:26,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2022-12-14 10:23:26,098 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:26,549 INFO L93 Difference]: Finished difference Result 201 states and 215 transitions. [2022-12-14 10:23:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 10:23:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 18 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 94 [2022-12-14 10:23:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:26,550 INFO L225 Difference]: With dead ends: 201 [2022-12-14 10:23:26,550 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 10:23:26,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=548, Invalid=2002, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 10:23:26,551 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:26,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:23:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 10:23:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-12-14 10:23:26,553 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) [2022-12-14 10:23:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 215 transitions. [2022-12-14 10:23:26,554 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 215 transitions. Word has length 94 [2022-12-14 10:23:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:26,554 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 215 transitions. [2022-12-14 10:23:26,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 215 transitions. [2022-12-14 10:23:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 10:23:26,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:26,555 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 48, 9, 8, 8, 1, 1] [2022-12-14 10:23:26,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-14 10:23:26,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:26,757 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash -10477257, now seen corresponding path program 4 times [2022-12-14 10:23:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:26,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590616247] [2022-12-14 10:23:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4012 backedges. 2470 proven. 195 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2022-12-14 10:23:27,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:27,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590616247] [2022-12-14 10:23:27,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590616247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:27,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926724535] [2022-12-14 10:23:27,253 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:23:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:27,254 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:27,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 10:23:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:27,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 10:23:27,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4012 backedges. 2609 proven. 466 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2022-12-14 10:23:27,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4012 backedges. 2609 proven. 466 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2022-12-14 10:23:27,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926724535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:27,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [513460463] [2022-12-14 10:23:27,874 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:27,874 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:27,874 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:27,874 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:27,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:27,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:27,883 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:27,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:27,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:23:28,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:28,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:28,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:28,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:28,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:28,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:28,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:28,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:28,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:28,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:28,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:28,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:28,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:28,400 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:28,995 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9858#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:28,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:28,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:28,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 36 [2022-12-14 10:23:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036977945] [2022-12-14 10:23:28,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:28,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 10:23:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 10:23:28,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1456, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 10:23:28,999 INFO L87 Difference]: Start difference. First operand 201 states and 215 transitions. Second operand has 36 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:29,973 INFO L93 Difference]: Finished difference Result 201 states and 211 transitions. [2022-12-14 10:23:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-14 10:23:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2022-12-14 10:23:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:29,974 INFO L225 Difference]: With dead ends: 201 [2022-12-14 10:23:29,974 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 10:23:29,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 490 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=932, Invalid=4618, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 10:23:29,977 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:29,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:23:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 10:23:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-12-14 10:23:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.055) internal successors, (211), 200 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2022-12-14 10:23:29,981 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 173 [2022-12-14 10:23:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:29,981 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2022-12-14 10:23:29,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2022-12-14 10:23:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 10:23:29,982 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:29,982 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 51, 9, 8, 8, 1, 1] [2022-12-14 10:23:29,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-14 10:23:30,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 10:23:30,183 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 985549444, now seen corresponding path program 5 times [2022-12-14 10:23:30,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:30,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95906073] [2022-12-14 10:23:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4486 backedges. 2794 proven. 261 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2022-12-14 10:23:30,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:30,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95906073] [2022-12-14 10:23:30,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95906073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:30,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590364737] [2022-12-14 10:23:30,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:30,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:30,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:30,694 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:30,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 10:23:30,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 10:23:30,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:30,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 10:23:30,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4486 backedges. 2197 proven. 298 refuted. 0 times theorem prover too weak. 1991 trivial. 0 not checked. [2022-12-14 10:23:31,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4486 backedges. 2197 proven. 298 refuted. 0 times theorem prover too weak. 1991 trivial. 0 not checked. [2022-12-14 10:23:31,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590364737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:31,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508936096] [2022-12-14 10:23:31,945 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:31,945 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:31,946 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:31,946 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:31,946 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:31,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:31,953 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:31,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:23:32,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:32,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:32,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:32,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:32,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:32,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:32,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:32,446 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:33,038 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11481#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:33,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:33,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:33,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 23] total 62 [2022-12-14 10:23:33,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194361976] [2022-12-14 10:23:33,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:33,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-14 10:23:33,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:33,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-14 10:23:33,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=3958, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 10:23:33,040 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand has 62 states, 62 states have (on average 2.774193548387097) internal successors, (172), 62 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:34,869 INFO L93 Difference]: Finished difference Result 226 states and 232 transitions. [2022-12-14 10:23:34,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-12-14 10:23:34,870 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.774193548387097) internal successors, (172), 62 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2022-12-14 10:23:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:34,870 INFO L225 Difference]: With dead ends: 226 [2022-12-14 10:23:34,870 INFO L226 Difference]: Without dead ends: 226 [2022-12-14 10:23:34,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5718 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3080, Invalid=17226, Unknown=0, NotChecked=0, Total=20306 [2022-12-14 10:23:34,873 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 537 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:34,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 0 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:23:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-14 10:23:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2022-12-14 10:23:34,875 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) [2022-12-14 10:23:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 231 transitions. [2022-12-14 10:23:34,876 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 231 transitions. Word has length 182 [2022-12-14 10:23:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:34,876 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 231 transitions. [2022-12-14 10:23:34,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.774193548387097) internal successors, (172), 62 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 231 transitions. [2022-12-14 10:23:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-12-14 10:23:34,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:34,877 INFO L195 NwaCegarLoop]: trace histogram [64, 64, 63, 10, 9, 9, 1, 1] [2022-12-14 10:23:34,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 10:23:35,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 10:23:35,079 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash 669616193, now seen corresponding path program 6 times [2022-12-14 10:23:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829323211] [2022-12-14 10:23:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6741 backedges. 4614 proven. 1187 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-12-14 10:23:35,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:35,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829323211] [2022-12-14 10:23:35,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829323211] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:35,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000192624] [2022-12-14 10:23:35,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:23:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:35,598 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:35,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 10:23:35,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:23:35,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:35,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 10:23:35,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6741 backedges. 4771 proven. 1030 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-12-14 10:23:36,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6741 backedges. 4771 proven. 1030 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-12-14 10:23:36,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000192624] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:36,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [327839859] [2022-12-14 10:23:36,406 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:36,406 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:36,406 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:36,406 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:36,406 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:36,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:36,415 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:36,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:36,495 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:36,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:23:36,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:36,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:36,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:36,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:36,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:36,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:36,875 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:37,272 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13447#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:37,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:37,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:37,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2022-12-14 10:23:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96524389] [2022-12-14 10:23:37,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:37,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 10:23:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 10:23:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1542, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 10:23:37,273 INFO L87 Difference]: Start difference. First operand 225 states and 231 transitions. Second operand has 38 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 37 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:38,031 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2022-12-14 10:23:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-14 10:23:38,031 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 37 states have internal predecessors, (135), 0 states have call successors, (0), 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 221 [2022-12-14 10:23:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:38,032 INFO L225 Difference]: With dead ends: 225 [2022-12-14 10:23:38,032 INFO L226 Difference]: Without dead ends: 225 [2022-12-14 10:23:38,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 629 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1695, Invalid=5961, Unknown=0, NotChecked=0, Total=7656 [2022-12-14 10:23:38,033 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:38,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:23:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-14 10:23:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-12-14 10:23:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.0178571428571428) internal successors, (228), 224 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 228 transitions. [2022-12-14 10:23:38,036 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 228 transitions. Word has length 221 [2022-12-14 10:23:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:38,036 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 228 transitions. [2022-12-14 10:23:38,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 37 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 228 transitions. [2022-12-14 10:23:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 10:23:38,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:38,037 INFO L195 NwaCegarLoop]: trace histogram [65, 65, 64, 10, 9, 9, 1, 1] [2022-12-14 10:23:38,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 10:23:38,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:38,239 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1091052990, now seen corresponding path program 7 times [2022-12-14 10:23:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686783294] [2022-12-14 10:23:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6942 backedges. 0 proven. 2046 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2022-12-14 10:23:39,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686783294] [2022-12-14 10:23:39,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686783294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:39,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168873945] [2022-12-14 10:23:39,046 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:23:39,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:39,047 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:39,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 10:23:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:39,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 10:23:39,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:39,273 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:23:39,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:23:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6942 backedges. 0 proven. 2046 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2022-12-14 10:23:39,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6942 backedges. 0 proven. 2046 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2022-12-14 10:23:40,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168873945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:40,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [450577722] [2022-12-14 10:23:40,436 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:40,436 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:40,436 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:40,436 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:40,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:40,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:40,444 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:40,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:40,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:23:40,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:40,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:40,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:40,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:40,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:40,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:40,763 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:40,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:40,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:40,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:40,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:23:40,866 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:23:40,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:23:40,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:40,905 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:41,288 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15365#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= 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|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:41,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:41,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:41,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-12-14 10:23:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035530813] [2022-12-14 10:23:41,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:41,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 10:23:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 10:23:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1387, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 10:23:41,289 INFO L87 Difference]: Start difference. First operand 225 states and 228 transitions. Second operand has 36 states, 35 states have (on average 3.2285714285714286) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:42,308 INFO L93 Difference]: Finished difference Result 285 states and 300 transitions. [2022-12-14 10:23:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 10:23:42,308 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.2285714285714286) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 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 224 [2022-12-14 10:23:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:42,310 INFO L225 Difference]: With dead ends: 285 [2022-12-14 10:23:42,310 INFO L226 Difference]: Without dead ends: 285 [2022-12-14 10:23:42,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=807, Invalid=3225, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 10:23:42,311 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:42,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:23:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-12-14 10:23:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 261. [2022-12-14 10:23:42,315 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) [2022-12-14 10:23:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 276 transitions. [2022-12-14 10:23:42,316 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 276 transitions. Word has length 224 [2022-12-14 10:23:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:42,316 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 276 transitions. [2022-12-14 10:23:42,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.2285714285714286) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 276 transitions. [2022-12-14 10:23:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-14 10:23:42,317 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:42,317 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 76, 10, 9, 9, 1, 1] [2022-12-14 10:23:42,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 10:23:42,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 10:23:42,517 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash 192270338, now seen corresponding path program 8 times [2022-12-14 10:23:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:42,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823891154] [2022-12-14 10:23:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 803 proven. 8236 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-12-14 10:23:43,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823891154] [2022-12-14 10:23:43,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823891154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104688993] [2022-12-14 10:23:43,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:23:43,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:43,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:43,535 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:43,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 10:23:43,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-12-14 10:23:43,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:23:43,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 10:23:43,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:23:43,839 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:23:43,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:23:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 1491 proven. 4122 refuted. 0 times theorem prover too weak. 3975 trivial. 0 not checked. [2022-12-14 10:23:44,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:23:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 0 proven. 5613 refuted. 0 times theorem prover too weak. 3975 trivial. 0 not checked. [2022-12-14 10:23:45,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104688993] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:23:45,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1550371447] [2022-12-14 10:23:45,809 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:23:45,810 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:23:45,810 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:23:45,810 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:23:45,810 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:23:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:23:45,818 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:23:45,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:45,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:23:45,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:45,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:23:45,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:46,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:46,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:46,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:46,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:46,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:46,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:46,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:23:46,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:46,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:23:46,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:23:46,285 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:23:46,864 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17584#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:23:46,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:23:46,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:23:46,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 17, 17] total 68 [2022-12-14 10:23:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912975781] [2022-12-14 10:23:46,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:23:46,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-14 10:23:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:23:46,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-14 10:23:46,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=4780, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 10:23:46,866 INFO L87 Difference]: Start difference. First operand 261 states and 276 transitions. Second operand has 69 states, 69 states have (on average 3.2028985507246377) internal successors, (221), 68 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:23:57,283 INFO L93 Difference]: Finished difference Result 451 states and 496 transitions. [2022-12-14 10:23:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2022-12-14 10:23:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.2028985507246377) internal successors, (221), 68 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2022-12-14 10:23:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:23:57,284 INFO L225 Difference]: With dead ends: 451 [2022-12-14 10:23:57,284 INFO L226 Difference]: Without dead ends: 451 [2022-12-14 10:23:57,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24483 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14639, Invalid=49117, Unknown=0, NotChecked=0, Total=63756 [2022-12-14 10:23:57,289 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 846 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:23:57,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 0 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:23:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-12-14 10:23:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 402. [2022-12-14 10:23:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 1.087281795511222) internal successors, (436), 401 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 436 transitions. [2022-12-14 10:23:57,293 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 436 transitions. Word has length 260 [2022-12-14 10:23:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:23:57,294 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 436 transitions. [2022-12-14 10:23:57,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.2028985507246377) internal successors, (221), 68 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:23:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 436 transitions. [2022-12-14 10:23:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2022-12-14 10:23:57,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:23:57,295 INFO L195 NwaCegarLoop]: trace histogram [121, 121, 120, 13, 12, 12, 1, 1] [2022-12-14 10:23:57,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-14 10:23:57,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:57,496 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:23:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:23:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash 508877003, now seen corresponding path program 9 times [2022-12-14 10:23:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:23:57,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903376037] [2022-12-14 10:23:57,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:23:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:23:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:23:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 23442 backedges. 16905 proven. 2795 refuted. 0 times theorem prover too weak. 3742 trivial. 0 not checked. [2022-12-14 10:23:58,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:23:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903376037] [2022-12-14 10:23:58,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903376037] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:23:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190312147] [2022-12-14 10:23:58,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:23:58,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:23:58,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:23:58,546 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:23:58,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 10:24:00,231 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:24:00,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:24:00,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 10:24:00,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:24:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 23442 backedges. 7946 proven. 13767 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2022-12-14 10:24:00,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:24:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 23442 backedges. 7946 proven. 13767 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2022-12-14 10:24:01,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190312147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:24:01,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915481969] [2022-12-14 10:24:01,966 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:24:01,966 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:24:01,967 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:24:01,967 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:24:01,967 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:24:01,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:24:01,974 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:24:01,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:02,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:24:02,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:02,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:02,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:02,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:02,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:02,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:02,305 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:02,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:24:02,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:02,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:02,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:02,405 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:02,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:24:02,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:02,446 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:24:02,897 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '21288#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= 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|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:24:02,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:24:02,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:24:02,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 35, 35] total 88 [2022-12-14 10:24:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007469504] [2022-12-14 10:24:02,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:24:02,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-12-14 10:24:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:24:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-12-14 10:24:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=7523, Unknown=0, NotChecked=0, Total=8930 [2022-12-14 10:24:02,900 INFO L87 Difference]: Start difference. First operand 402 states and 436 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) [2022-12-14 10:24:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:24:10,443 INFO L93 Difference]: Finished difference Result 894 states and 961 transitions. [2022-12-14 10:24:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2022-12-14 10:24:10,444 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 [2022-12-14 10:24:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:24:10,448 INFO L225 Difference]: With dead ends: 894 [2022-12-14 10:24:10,448 INFO L226 Difference]: Without dead ends: 894 [2022-12-14 10:24:10,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1500 GetRequests, 1128 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49209 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=17043, Invalid=119487, Unknown=0, NotChecked=0, Total=136530 [2022-12-14 10:24:10,454 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 699 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 3908 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:24:10,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 5 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3908 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 10:24:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-12-14 10:24:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 891. [2022-12-14 10:24:10,469 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) [2022-12-14 10:24:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 958 transitions. [2022-12-14 10:24:10,470 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 958 transitions. Word has length 401 [2022-12-14 10:24:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:24:10,470 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 958 transitions. [2022-12-14 10:24:10,470 INFO L496 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) [2022-12-14 10:24:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 958 transitions. [2022-12-14 10:24:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2022-12-14 10:24:10,474 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:24:10,474 INFO L195 NwaCegarLoop]: trace histogram [230, 230, 229, 22, 21, 21, 1, 1] [2022-12-14 10:24:10,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-14 10:24:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:24:10,676 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:24:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:24:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1348422111, now seen corresponding path program 10 times [2022-12-14 10:24:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:24:10,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103002398] [2022-12-14 10:24:10,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:24:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:24:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:24:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 84486 backedges. 38728 proven. 726 refuted. 0 times theorem prover too weak. 45032 trivial. 0 not checked. [2022-12-14 10:24:13,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:24:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103002398] [2022-12-14 10:24:13,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103002398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:24:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011908072] [2022-12-14 10:24:13,020 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:24:13,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:24:13,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:24:13,021 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:24:13,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 10:24:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:24:13,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 3245 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 10:24:13,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:24:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 84486 backedges. 49344 proven. 3202 refuted. 0 times theorem prover too weak. 31940 trivial. 0 not checked. [2022-12-14 10:24:14,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:24:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 84486 backedges. 49344 proven. 3202 refuted. 0 times theorem prover too weak. 31940 trivial. 0 not checked. [2022-12-14 10:24:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011908072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:24:14,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118755465] [2022-12-14 10:24:14,721 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:24:14,721 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:24:14,722 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:24:14,722 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:24:14,722 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:24:14,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:24:14,728 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:24:14,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:14,807 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:14,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:24:14,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:14,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:24:14,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:14,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:15,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:15,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:15,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:15,082 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:15,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:24:15,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:15,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:15,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:15,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:24:15,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:15,247 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:24:15,797 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '28219#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:24:15,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:24:15,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:24:15,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 66 [2022-12-14 10:24:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769210372] [2022-12-14 10:24:15,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:24:15,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-14 10:24:15,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:24:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-14 10:24:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=4375, Unknown=0, NotChecked=0, Total=5112 [2022-12-14 10:24:15,799 INFO L87 Difference]: Start difference. First operand 891 states and 958 transitions. Second operand has 66 states, 66 states have (on average 3.5303030303030303) internal successors, (233), 66 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:24:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:24:19,275 INFO L93 Difference]: Finished difference Result 891 states and 947 transitions. [2022-12-14 10:24:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-12-14 10:24:19,276 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.5303030303030303) internal successors, (233), 66 states have internal predecessors, (233), 0 states have call successors, (0), 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 [2022-12-14 10:24:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:24:19,277 INFO L225 Difference]: With dead ends: 891 [2022-12-14 10:24:19,277 INFO L226 Difference]: Without dead ends: 891 [2022-12-14 10:24:19,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2396 GetRequests, 2212 SyntacticMatches, 12 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8170 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4943, Invalid=25159, Unknown=0, NotChecked=0, Total=30102 [2022-12-14 10:24:19,279 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4088 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:24:19,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 4106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4088 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 10:24:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-12-14 10:24:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2022-12-14 10:24:19,285 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) [2022-12-14 10:24:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 947 transitions. [2022-12-14 10:24:19,286 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 947 transitions. Word has length 755 [2022-12-14 10:24:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:24:19,287 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 947 transitions. [2022-12-14 10:24:19,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.5303030303030303) internal successors, (233), 66 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:24:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 947 transitions. [2022-12-14 10:24:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2022-12-14 10:24:19,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:24:19,291 INFO L195 NwaCegarLoop]: trace histogram [239, 239, 238, 22, 21, 21, 1, 1] [2022-12-14 10:24:19,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 10:24:19,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 10:24:19,493 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:24:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:24:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash -564658126, now seen corresponding path program 11 times [2022-12-14 10:24:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:24:19,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433699474] [2022-12-14 10:24:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:24:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:24:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:24:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 90993 backedges. 41545 proven. 846 refuted. 0 times theorem prover too weak. 48602 trivial. 0 not checked. [2022-12-14 10:24:22,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:24:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433699474] [2022-12-14 10:24:22,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433699474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:24:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219801328] [2022-12-14 10:24:22,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:24:22,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:24:22,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:24:22,088 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:24:22,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 10:24:23,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-12-14 10:24:23,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:24:23,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 10:24:23,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:24:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 90993 backedges. 33903 proven. 3534 refuted. 0 times theorem prover too weak. 53556 trivial. 0 not checked. [2022-12-14 10:24:24,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:24:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 90993 backedges. 33903 proven. 3534 refuted. 0 times theorem prover too weak. 53556 trivial. 0 not checked. [2022-12-14 10:24:25,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219801328] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:24:25,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146174419] [2022-12-14 10:24:25,551 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:24:25,551 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:24:25,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:24:25,551 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:24:25,551 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:24:25,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:24:25,558 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:24:25,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:25,636 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:25,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:24:25,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:25,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:25,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:25,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:25,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:25,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:25,856 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:25,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:24:25,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:25,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:25,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:25,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:24:25,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:26,015 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:24:26,824 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '35010#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:24:26,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:24:26,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:24:26,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 42, 42] total 112 [2022-12-14 10:24:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749926701] [2022-12-14 10:24:26,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:24:26,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-12-14 10:24:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:24:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-12-14 10:24:26,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1924, Invalid=11882, Unknown=0, NotChecked=0, Total=13806 [2022-12-14 10:24:26,828 INFO L87 Difference]: Start difference. First operand 891 states and 947 transitions. Second operand has 112 states, 112 states have (on average 2.9375) internal successors, (329), 112 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) [2022-12-14 10:24:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:24:33,692 INFO L93 Difference]: Finished difference Result 1030 states and 1091 transitions. [2022-12-14 10:24:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-12-14 10:24:33,693 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.9375) internal successors, (329), 112 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 [2022-12-14 10:24:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:24:33,697 INFO L225 Difference]: With dead ends: 1030 [2022-12-14 10:24:33,697 INFO L226 Difference]: Without dead ends: 1030 [2022-12-14 10:24:33,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2575 GetRequests, 2261 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31335 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13440, Invalid=86100, Unknown=0, NotChecked=0, Total=99540 [2022-12-14 10:24:33,704 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1050 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:24:33,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 0 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 10:24:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-12-14 10:24:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 960. [2022-12-14 10:24:33,714 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) [2022-12-14 10:24:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1014 transitions. [2022-12-14 10:24:33,716 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1014 transitions. Word has length 782 [2022-12-14 10:24:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:24:33,716 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1014 transitions. [2022-12-14 10:24:33,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.9375) internal successors, (329), 112 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) [2022-12-14 10:24:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1014 transitions. [2022-12-14 10:24:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2022-12-14 10:24:33,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:24:33,724 INFO L195 NwaCegarLoop]: trace histogram [254, 254, 253, 22, 21, 21, 1, 1] [2022-12-14 10:24:33,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 10:24:33,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 10:24:33,925 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:24:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:24:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1583406753, now seen corresponding path program 12 times [2022-12-14 10:24:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:24:33,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193737626] [2022-12-14 10:24:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:24:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:24:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:24:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 102378 backedges. 53524 proven. 975 refuted. 0 times theorem prover too weak. 47879 trivial. 0 not checked. [2022-12-14 10:24:36,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:24:36,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193737626] [2022-12-14 10:24:36,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193737626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:24:36,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471536899] [2022-12-14 10:24:36,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:24:36,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:24:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:24:36,786 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:24:36,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 10:24:50,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:24:50,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:24:50,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 3509 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 10:24:50,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:24:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 102378 backedges. 82604 proven. 7422 refuted. 0 times theorem prover too weak. 12352 trivial. 0 not checked. [2022-12-14 10:24:51,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:24:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 102378 backedges. 82604 proven. 7422 refuted. 0 times theorem prover too weak. 12352 trivial. 0 not checked. [2022-12-14 10:24:51,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471536899] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:24:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1887538444] [2022-12-14 10:24:51,979 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:24:51,980 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:24:51,980 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:24:51,980 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:24:51,980 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:24:51,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:24:51,986 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:24:52,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:52,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:24:52,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:52,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:24:52,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:52,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:52,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:52,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:52,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:52,287 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:52,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:24:52,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:52,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:24:52,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:24:52,386 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:24:52,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:24:52,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:24:52,425 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:24:52,927 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '42443#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= 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|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:24:52,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:24:52,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:24:52,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 84 [2022-12-14 10:24:52,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784977415] [2022-12-14 10:24:52,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:24:52,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-12-14 10:24:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:24:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-12-14 10:24:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1173, Invalid=6837, Unknown=0, NotChecked=0, Total=8010 [2022-12-14 10:24:52,929 INFO L87 Difference]: Start difference. First operand 960 states and 1014 transitions. Second operand has 84 states, 84 states have (on average 3.7857142857142856) internal successors, (318), 84 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:25:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:25:00,747 INFO L93 Difference]: Finished difference Result 960 states and 977 transitions. [2022-12-14 10:25:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2022-12-14 10:25:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.7857142857142856) internal successors, (318), 84 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 827 [2022-12-14 10:25:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:25:00,749 INFO L225 Difference]: With dead ends: 960 [2022-12-14 10:25:00,749 INFO L226 Difference]: Without dead ends: 960 [2022-12-14 10:25:00,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2717 GetRequests, 2412 SyntacticMatches, 14 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23052 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=15540, Invalid=70016, Unknown=0, NotChecked=0, Total=85556 [2022-12-14 10:25:00,753 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7803 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:25:00,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 7826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7803 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 10:25:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-12-14 10:25:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2022-12-14 10:25:00,758 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) [2022-12-14 10:25:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 977 transitions. [2022-12-14 10:25:00,759 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 977 transitions. Word has length 827 [2022-12-14 10:25:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:25:00,759 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 977 transitions. [2022-12-14 10:25:00,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.7857142857142856) internal successors, (318), 84 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:25:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 977 transitions. [2022-12-14 10:25:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2022-12-14 10:25:00,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:25:00,765 INFO L195 NwaCegarLoop]: trace histogram [271, 271, 270, 22, 21, 21, 1, 1] [2022-12-14 10:25:00,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-14 10:25:00,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:00,966 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:25:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:25:00,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1731696438, now seen corresponding path program 13 times [2022-12-14 10:25:00,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:25:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214695084] [2022-12-14 10:25:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:25:00,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:25:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:25:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 116097 backedges. 68837 proven. 1260 refuted. 0 times theorem prover too weak. 46000 trivial. 0 not checked. [2022-12-14 10:25:04,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:25:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214695084] [2022-12-14 10:25:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214695084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:25:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176365113] [2022-12-14 10:25:04,390 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:25:04,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:04,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:25:04,391 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:25:04,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 10:25:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:25:04,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 3696 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 10:25:04,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:25:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 116097 backedges. 84616 proven. 7246 refuted. 0 times theorem prover too weak. 24235 trivial. 0 not checked. [2022-12-14 10:25:05,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:25:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 116097 backedges. 84616 proven. 7246 refuted. 0 times theorem prover too weak. 24235 trivial. 0 not checked. [2022-12-14 10:25:06,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176365113] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:25:06,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [575426948] [2022-12-14 10:25:06,868 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:25:06,869 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:25:06,869 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:25:06,869 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:25:06,869 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:25:06,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:06,877 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:25:06,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:25:06,957 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:25:06,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:25:07,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:07,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:25:07,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:25:07,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:07,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:07,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:25:07,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:07,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:25:07,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:07,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:25:07,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:07,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:25:07,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:07,347 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:25:08,026 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '50124#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:25:08,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:25:08,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:25:08,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 86 [2022-12-14 10:25:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327676773] [2022-12-14 10:25:08,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:25:08,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-12-14 10:25:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:25:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-12-14 10:25:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=7181, Unknown=0, NotChecked=0, Total=8372 [2022-12-14 10:25:08,029 INFO L87 Difference]: Start difference. First operand 960 states and 977 transitions. Second operand has 86 states, 86 states have (on average 3.546511627906977) internal successors, (305), 86 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:25:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:25:15,390 INFO L93 Difference]: Finished difference Result 960 states and 975 transitions. [2022-12-14 10:25:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-12-14 10:25:15,390 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 3.546511627906977) internal successors, (305), 86 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 878 [2022-12-14 10:25:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:25:15,391 INFO L225 Difference]: With dead ends: 960 [2022-12-14 10:25:15,392 INFO L226 Difference]: Without dead ends: 960 [2022-12-14 10:25:15,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2839 GetRequests, 2565 SyntacticMatches, 16 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18412 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11062, Invalid=56278, Unknown=0, NotChecked=0, Total=67340 [2022-12-14 10:25:15,394 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7503 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:25:15,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 7529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7503 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 10:25:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-12-14 10:25:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2022-12-14 10:25:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.0166840458811262) internal successors, (975), 959 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:25:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 975 transitions. [2022-12-14 10:25:15,401 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 975 transitions. Word has length 878 [2022-12-14 10:25:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:25:15,401 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 975 transitions. [2022-12-14 10:25:15,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 3.546511627906977) internal successors, (305), 86 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:25:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 975 transitions. [2022-12-14 10:25:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2022-12-14 10:25:15,406 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:25:15,406 INFO L195 NwaCegarLoop]: trace histogram [273, 273, 272, 22, 21, 21, 1, 1] [2022-12-14 10:25:15,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 10:25:15,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:15,607 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:25:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:25:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1712998742, now seen corresponding path program 14 times [2022-12-14 10:25:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:25:15,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107785732] [2022-12-14 10:25:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:25:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:25:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:25:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 117768 backedges. 89380 proven. 9278 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2022-12-14 10:25:18,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:25:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107785732] [2022-12-14 10:25:18,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107785732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:25:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467338104] [2022-12-14 10:25:18,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:25:18,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:25:18,743 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:25:18,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 10:25:19,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-12-14 10:25:19,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:25:19,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 10:25:19,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:25:19,820 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:25:19,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:25:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 117768 backedges. 0 proven. 18492 refuted. 0 times theorem prover too weak. 99276 trivial. 0 not checked. [2022-12-14 10:25:22,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:25:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 117768 backedges. 0 proven. 18492 refuted. 0 times theorem prover too weak. 99276 trivial. 0 not checked. [2022-12-14 10:25:25,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467338104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:25:25,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1232072217] [2022-12-14 10:25:25,691 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:25:25,691 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:25:25,691 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:25:25,691 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:25:25,691 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:25:25,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:25,699 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:25:25,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:25:25,807 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:25:25,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:25:25,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:25,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:25:25,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:25:25,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:25,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:25,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:25:25,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:25:26,031 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:25:26,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:25:26,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:26,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:25:26,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:26,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:25:26,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:25:26,177 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:25:26,791 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '57770#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:25:26,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:25:26,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:25:26,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 24, 24] total 84 [2022-12-14 10:25:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602394660] [2022-12-14 10:25:26,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:25:26,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-12-14 10:25:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:25:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-12-14 10:25:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1359, Invalid=6831, Unknown=0, NotChecked=0, Total=8190 [2022-12-14 10:25:26,794 INFO L87 Difference]: Start difference. First operand 960 states and 975 transitions. Second operand has 85 states, 85 states have (on average 3.6588235294117646) internal successors, (311), 84 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) [2022-12-14 10:25:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:25:35,123 INFO L93 Difference]: Finished difference Result 1044 states and 1078 transitions. [2022-12-14 10:25:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2022-12-14 10:25:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.6588235294117646) internal successors, (311), 84 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) Word has length 884 [2022-12-14 10:25:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:25:35,125 INFO L225 Difference]: With dead ends: 1044 [2022-12-14 10:25:35,125 INFO L226 Difference]: Without dead ends: 1044 [2022-12-14 10:25:35,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2904 GetRequests, 2597 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27350 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=20764, Invalid=74408, Unknown=0, NotChecked=0, Total=95172 [2022-12-14 10:25:35,130 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 433 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:25:35,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 0 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 10:25:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-12-14 10:25:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 990. [2022-12-14 10:25:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.025278058645096) internal successors, (1014), 989 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) [2022-12-14 10:25:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1014 transitions. [2022-12-14 10:25:35,137 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1014 transitions. Word has length 884 [2022-12-14 10:25:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:25:35,138 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1014 transitions. [2022-12-14 10:25:35,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.6588235294117646) internal successors, (311), 84 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) [2022-12-14 10:25:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1014 transitions. [2022-12-14 10:25:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2022-12-14 10:25:35,154 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:25:35,154 INFO L195 NwaCegarLoop]: trace histogram [284, 284, 283, 22, 21, 21, 1, 1] [2022-12-14 10:25:35,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-14 10:25:35,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:35,355 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:25:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:25:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash -42844139, now seen corresponding path program 15 times [2022-12-14 10:25:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:25:35,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031752761] [2022-12-14 10:25:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:25:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:25:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:25:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 127173 backedges. 102184 proven. 12671 refuted. 0 times theorem prover too weak. 12318 trivial. 0 not checked. [2022-12-14 10:25:38,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:25:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031752761] [2022-12-14 10:25:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031752761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:25:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691321917] [2022-12-14 10:25:38,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:25:38,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:38,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:25:38,844 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:25:38,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 10:26:40,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:26:40,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:26:40,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 3839 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 10:26:40,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 127173 backedges. 103001 proven. 11854 refuted. 0 times theorem prover too weak. 12318 trivial. 0 not checked. [2022-12-14 10:26:41,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 127173 backedges. 103001 proven. 11854 refuted. 0 times theorem prover too weak. 12318 trivial. 0 not checked. [2022-12-14 10:26:42,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691321917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:42,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [280254011] [2022-12-14 10:26:42,572 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:26:42,572 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:26:42,572 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:26:42,573 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:26:42,573 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:26:42,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:42,579 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:26:42,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:26:42,652 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:26:42,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:26:42,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:42,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:26:42,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:42,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:42,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:26:42,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:26:42,874 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:26:42,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:26:42,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:42,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:26:42,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:42,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:26:43,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:43,028 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:26:43,579 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '65824#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:26:43,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:26:43,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:43,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 81 [2022-12-14 10:26:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519657919] [2022-12-14 10:26:43,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:43,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-12-14 10:26:43,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:43,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-12-14 10:26:43,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=6261, Unknown=0, NotChecked=0, Total=7656 [2022-12-14 10:26:43,581 INFO L87 Difference]: Start difference. First operand 990 states and 1014 transitions. Second operand has 82 states, 82 states have (on average 3.658536585365854) internal successors, (300), 81 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:49,396 INFO L93 Difference]: Finished difference Result 990 states and 1009 transitions. [2022-12-14 10:26:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2022-12-14 10:26:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 3.658536585365854) internal successors, (300), 81 states have internal predecessors, (300), 0 states have call successors, (0), 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 917 [2022-12-14 10:26:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:49,402 INFO L225 Difference]: With dead ends: 990 [2022-12-14 10:26:49,402 INFO L226 Difference]: Without dead ends: 990 [2022-12-14 10:26:49,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2998 GetRequests, 2684 SyntacticMatches, 19 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27023 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=23079, Invalid=64833, Unknown=0, NotChecked=0, Total=87912 [2022-12-14 10:26:49,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:49,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 10:26:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-12-14 10:26:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2022-12-14 10:26:49,411 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) [2022-12-14 10:26:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1009 transitions. [2022-12-14 10:26:49,412 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1009 transitions. Word has length 917 [2022-12-14 10:26:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:49,413 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1009 transitions. [2022-12-14 10:26:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.658536585365854) internal successors, (300), 81 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1009 transitions. [2022-12-14 10:26:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2022-12-14 10:26:49,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:49,421 INFO L195 NwaCegarLoop]: trace histogram [285, 285, 284, 22, 21, 21, 1, 1] [2022-12-14 10:26:49,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 10:26:49,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 10:26:49,622 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:26:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -647800766, now seen corresponding path program 16 times [2022-12-14 10:26:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:49,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15705628] [2022-12-14 10:26:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 128046 backedges. 1994 proven. 120487 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2022-12-14 10:26:54,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15705628] [2022-12-14 10:26:54,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15705628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579839872] [2022-12-14 10:26:54,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:26:54,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:54,543 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:54,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 10:26:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:55,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 3850 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 10:26:55,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 128046 backedges. 8955 proven. 113400 refuted. 0 times theorem prover too weak. 5691 trivial. 0 not checked. [2022-12-14 10:26:56,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 128046 backedges. 8955 proven. 113400 refuted. 0 times theorem prover too weak. 5691 trivial. 0 not checked. [2022-12-14 10:26:57,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579839872] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:57,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356572152] [2022-12-14 10:26:57,301 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:26:57,301 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:26:57,302 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:26:57,302 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:26:57,302 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:26:57,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:57,309 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:26:57,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:26:57,411 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:26:57,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:26:57,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:57,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:26:57,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:26:57,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:57,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:26:57,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:57,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:26:57,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:57,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:26:57,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:57,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:26:57,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:26:57,793 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:26:58,538 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '73825#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:26:58,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:26:58,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:58,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 47, 47] total 82 [2022-12-14 10:26:58,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897369545] [2022-12-14 10:26:58,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:58,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-14 10:26:58,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-14 10:26:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1570, Invalid=6262, Unknown=0, NotChecked=0, Total=7832 [2022-12-14 10:26:58,540 INFO L87 Difference]: Start difference. First operand 990 states and 1009 transitions. Second operand has 83 states, 83 states have (on average 3.7590361445783134) internal successors, (312), 82 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:05,866 INFO L93 Difference]: Finished difference Result 1480 states and 1512 transitions. [2022-12-14 10:27:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 329 states. [2022-12-14 10:27:05,866 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.7590361445783134) internal successors, (312), 82 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 920 [2022-12-14 10:27:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:05,868 INFO L225 Difference]: With dead ends: 1480 [2022-12-14 10:27:05,868 INFO L226 Difference]: Without dead ends: 1480 [2022-12-14 10:27:05,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3138 GetRequests, 2682 SyntacticMatches, 45 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76243 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=30536, Invalid=139620, Unknown=0, NotChecked=0, Total=170156 [2022-12-14 10:27:05,876 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 359 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:05,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 8 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 10:27:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2022-12-14 10:27:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1194. [2022-12-14 10:27:05,882 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) [2022-12-14 10:27:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1219 transitions. [2022-12-14 10:27:05,883 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1219 transitions. Word has length 920 [2022-12-14 10:27:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:05,884 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1219 transitions. [2022-12-14 10:27:05,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.7590361445783134) internal successors, (312), 82 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1219 transitions. [2022-12-14 10:27:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2022-12-14 10:27:05,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:05,890 INFO L195 NwaCegarLoop]: trace histogram [305, 305, 304, 23, 22, 22, 1, 1] [2022-12-14 10:27:05,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 10:27:06,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 10:27:06,091 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:27:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -94710165, now seen corresponding path program 17 times [2022-12-14 10:27:06,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:06,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348025656] [2022-12-14 10:27:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 146505 backedges. 118958 proven. 14639 refuted. 0 times theorem prover too weak. 12908 trivial. 0 not checked. [2022-12-14 10:27:10,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:10,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348025656] [2022-12-14 10:27:10,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348025656] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:10,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317538978] [2022-12-14 10:27:10,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:27:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:10,193 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:10,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 10:27:11,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2022-12-14 10:27:11,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:27:11,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 10:27:11,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:11,695 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:27:11,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 10:27:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 146505 backedges. 17578 proven. 28433 refuted. 0 times theorem prover too weak. 100494 trivial. 0 not checked. [2022-12-14 10:27:14,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 146505 backedges. 9 proven. 46002 refuted. 0 times theorem prover too weak. 100494 trivial. 0 not checked. [2022-12-14 10:27:18,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317538978] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:18,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393767574] [2022-12-14 10:27:18,856 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:27:18,856 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:27:18,856 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:27:18,856 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:27:18,856 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:27:18,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:18,863 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:27:18,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:27:18,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:27:18,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:27:19,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:27:19,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:27:19,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:27:19,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:27:19,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:27:19,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:27:19,176 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:27:19,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:27:19,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:27:19,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:27:19,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:27:19,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:27:19,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:27:19,321 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:27:19,951 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '83152#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:27:19,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:27:19,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:19,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 32, 32] total 106 [2022-12-14 10:27:19,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40850505] [2022-12-14 10:27:19,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:19,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-12-14 10:27:19,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-12-14 10:27:19,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=10676, Unknown=0, NotChecked=0, Total=12656 [2022-12-14 10:27:19,954 INFO L87 Difference]: Start difference. First operand 1194 states and 1219 transitions. Second operand has 107 states, 107 states have (on average 3.457943925233645) internal successors, (370), 106 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:45,596 INFO L93 Difference]: Finished difference Result 1383 states and 1437 transitions. [2022-12-14 10:27:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 410 states. [2022-12-14 10:27:45,596 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 3.457943925233645) internal successors, (370), 106 states have internal predecessors, (370), 0 states have call successors, (0), 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 [2022-12-14 10:27:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:45,598 INFO L225 Difference]: With dead ends: 1383 [2022-12-14 10:27:45,598 INFO L226 Difference]: Without dead ends: 1383 [2022-12-14 10:27:45,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3397 GetRequests, 2878 SyntacticMatches, 0 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90520 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=45231, Invalid=225689, Unknown=0, NotChecked=0, Total=270920 [2022-12-14 10:27:45,609 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5093 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 5093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:45,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 0 Invalid, 5266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 5093 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 10:27:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-12-14 10:27:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1236. [2022-12-14 10:27:45,616 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) [2022-12-14 10:27:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1269 transitions. [2022-12-14 10:27:45,617 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1269 transitions. Word has length 983 [2022-12-14 10:27:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:45,617 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1269 transitions. [2022-12-14 10:27:45,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 3.457943925233645) internal successors, (370), 106 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1269 transitions. [2022-12-14 10:27:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1161 [2022-12-14 10:27:45,626 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:45,627 INFO L195 NwaCegarLoop]: trace histogram [362, 362, 361, 25, 24, 24, 1, 1] [2022-12-14 10:27:45,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-14 10:27:45,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:45,828 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:27:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash 783269984, now seen corresponding path program 18 times [2022-12-14 10:27:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:45,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172589751] [2022-12-14 10:27:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 205563 backedges. 165250 proven. 16800 refuted. 0 times theorem prover too weak. 23513 trivial. 0 not checked. [2022-12-14 10:27:50,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:50,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172589751] [2022-12-14 10:27:50,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172589751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:50,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455081285] [2022-12-14 10:27:50,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:27:50,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:50,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:50,703 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:50,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 10:28:26,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:28:26,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:28:26,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 4793 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 10:28:26,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 205563 backedges. 2242 proven. 194736 refuted. 0 times theorem prover too weak. 8585 trivial. 0 not checked. [2022-12-14 10:28:28,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 205563 backedges. 2242 proven. 194736 refuted. 0 times theorem prover too weak. 8585 trivial. 0 not checked. [2022-12-14 10:28:30,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455081285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:30,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1501563976] [2022-12-14 10:28:30,822 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:28:30,822 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:28:30,822 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:28:30,822 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:28:30,822 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:28:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:30,831 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:28:30,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:28:30,916 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:28:30,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:28:30,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:28:31,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:28:31,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:28:31,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:28:31,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:28:31,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:28:31,334 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:28:32,256 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '93689#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:28:32,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:28:32,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:32,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 59, 59] total 141 [2022-12-14 10:28:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457945590] [2022-12-14 10:28:32,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:32,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2022-12-14 10:28:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:32,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2022-12-14 10:28:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3069, Invalid=18687, Unknown=0, NotChecked=0, Total=21756 [2022-12-14 10:28:32,259 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) [2022-12-14 10:28:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:56,229 INFO L93 Difference]: Finished difference Result 3538 states and 3725 transitions. [2022-12-14 10:28:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 620 states. [2022-12-14 10:28:56,229 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 [2022-12-14 10:28:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:56,237 INFO L225 Difference]: With dead ends: 3538 [2022-12-14 10:28:56,237 INFO L226 Difference]: Without dead ends: 3538 [2022-12-14 10:28:56,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4137 GetRequests, 3357 SyntacticMatches, 19 SemanticMatches, 761 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220931 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=55314, Invalid=526092, Unknown=0, NotChecked=0, Total=581406 [2022-12-14 10:28:56,257 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 1299 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15276 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 15447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 15276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:56,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 5 Invalid, 15447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 15276 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-12-14 10:28:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2022-12-14 10:28:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 2313. [2022-12-14 10:28:56,271 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) [2022-12-14 10:28:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2423 transitions. [2022-12-14 10:28:56,273 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2423 transitions. Word has length 1160 [2022-12-14 10:28:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:56,273 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 2423 transitions. [2022-12-14 10:28:56,273 INFO L496 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) [2022-12-14 10:28:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2423 transitions. [2022-12-14 10:28:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2022-12-14 10:28:56,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:56,289 INFO L195 NwaCegarLoop]: trace histogram [517, 517, 516, 32, 31, 31, 1, 1] [2022-12-14 10:28:56,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 10:28:56,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 10:28:56,490 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:28:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 319298678, now seen corresponding path program 19 times [2022-12-14 10:28:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:56,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097310187] [2022-12-14 10:28:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:29:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 417611 backedges. 172873 proven. 5593 refuted. 0 times theorem prover too weak. 239145 trivial. 0 not checked. [2022-12-14 10:29:05,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:29:05,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097310187] [2022-12-14 10:29:05,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097310187] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:29:05,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947272304] [2022-12-14 10:29:05,444 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:29:05,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:29:05,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:29:05,445 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:29:05,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 10:29:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:29:06,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 6722 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 10:29:06,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:29:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 417611 backedges. 303442 proven. 18082 refuted. 0 times theorem prover too weak. 96087 trivial. 0 not checked. [2022-12-14 10:29:08,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:29:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 417611 backedges. 303442 proven. 18082 refuted. 0 times theorem prover too weak. 96087 trivial. 0 not checked. [2022-12-14 10:29:10,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947272304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:29:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [827396364] [2022-12-14 10:29:10,545 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:29:10,545 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:29:10,545 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:29:10,545 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:29:10,545 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:29:10,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:29:10,555 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:29:10,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:29:10,637 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:29:10,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:29:10,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:10,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:29:10,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:10,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:10,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:29:10,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:29:10,849 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:29:10,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:29:10,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:10,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:29:10,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:10,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:29:10,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:10,993 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:29:11,796 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '110764#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:29:11,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:29:11,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:29:11,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 46, 46] total 118 [2022-12-14 10:29:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410804627] [2022-12-14 10:29:11,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:29:11,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-12-14 10:29:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:29:11,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-12-14 10:29:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=13097, Unknown=0, NotChecked=0, Total=15252 [2022-12-14 10:29:11,799 INFO L87 Difference]: Start difference. First operand 2313 states and 2423 transitions. Second operand has 118 states, 118 states have (on average 3.5762711864406778) internal successors, (422), 118 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:29:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:29:30,942 INFO L93 Difference]: Finished difference Result 1875 states and 1929 transitions. [2022-12-14 10:29:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 347 states. [2022-12-14 10:29:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 118 states have (on average 3.5762711864406778) internal successors, (422), 118 states have internal predecessors, (422), 0 states have call successors, (0), 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 [2022-12-14 10:29:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:29:30,945 INFO L225 Difference]: With dead ends: 1875 [2022-12-14 10:29:30,945 INFO L226 Difference]: Without dead ends: 1875 [2022-12-14 10:29:30,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5310 GetRequests, 4845 SyntacticMatches, 22 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54543 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=33208, Invalid=164372, Unknown=0, NotChecked=0, Total=197580 [2022-12-14 10:29:30,953 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16560 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 16560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:29:30,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 16598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 16560 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-14 10:29:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-12-14 10:29:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2022-12-14 10:29:30,967 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) [2022-12-14 10:29:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1929 transitions. [2022-12-14 10:29:30,970 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1929 transitions. Word has length 1646 [2022-12-14 10:29:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:29:30,971 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 1929 transitions. [2022-12-14 10:29:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 3.5762711864406778) internal successors, (422), 118 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:29:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1929 transitions. [2022-12-14 10:29:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1692 [2022-12-14 10:29:30,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:29:30,987 INFO L195 NwaCegarLoop]: trace histogram [532, 532, 531, 32, 31, 31, 1, 1] [2022-12-14 10:29:31,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-14 10:29:31,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:29:31,188 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:29:31,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:29:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 790476385, now seen corresponding path program 20 times [2022-12-14 10:29:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:29:31,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651121254] [2022-12-14 10:29:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:29:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:29:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:29:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 441656 backedges. 156982 proven. 2760 refuted. 0 times theorem prover too weak. 281914 trivial. 0 not checked. [2022-12-14 10:29:40,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:29:40,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651121254] [2022-12-14 10:29:40,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651121254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:29:40,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080962631] [2022-12-14 10:29:40,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:29:40,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:29:40,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:29:40,764 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:29:40,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 10:29:48,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2022-12-14 10:29:48,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:29:48,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 10:29:48,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:29:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 441656 backedges. 123620 proven. 8713 refuted. 0 times theorem prover too weak. 309323 trivial. 0 not checked. [2022-12-14 10:29:50,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:29:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 441656 backedges. 123620 proven. 8713 refuted. 0 times theorem prover too weak. 309323 trivial. 0 not checked. [2022-12-14 10:29:54,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080962631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:29:54,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [5648790] [2022-12-14 10:29:54,009 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:29:54,009 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:29:54,009 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:29:54,009 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:29:54,009 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:29:54,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:29:54,017 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:29:54,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:29:54,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:29:54,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:29:54,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:29:54,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:29:54,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:29:54,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:29:54,491 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:29:55,504 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '125479#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:29:55,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:29:55,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:29:55,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 63, 63] total 176 [2022-12-14 10:29:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404638260] [2022-12-14 10:29:55,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:29:55,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 176 states [2022-12-14 10:29:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:29:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2022-12-14 10:29:55,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4331, Invalid=28611, Unknown=0, NotChecked=0, Total=32942 [2022-12-14 10:29:55,508 INFO L87 Difference]: Start difference. First operand 1875 states and 1929 transitions. Second operand has 176 states, 176 states have (on average 2.960227272727273) internal successors, (521), 176 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:30:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:30:08,558 INFO L93 Difference]: Finished difference Result 2170 states and 2233 transitions. [2022-12-14 10:30:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2022-12-14 10:30:08,559 INFO L78 Accepts]: Start accepts. Automaton has has 176 states, 176 states have (on average 2.960227272727273) internal successors, (521), 176 states have internal predecessors, (521), 0 states have call successors, (0), 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 [2022-12-14 10:30:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:30:08,569 INFO L225 Difference]: With dead ends: 2170 [2022-12-14 10:30:08,569 INFO L226 Difference]: Without dead ends: 2170 [2022-12-14 10:30:08,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5428 GetRequests, 4946 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72273 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=31156, Invalid=202616, Unknown=0, NotChecked=0, Total=233772 [2022-12-14 10:30:08,579 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1705 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5355 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 5355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:30:08,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 0 Invalid, 5607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 5355 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 10:30:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-12-14 10:30:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1875. [2022-12-14 10:30:08,599 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) [2022-12-14 10:30:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1919 transitions. [2022-12-14 10:30:08,603 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1919 transitions. Word has length 1691 [2022-12-14 10:30:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:30:08,604 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 1919 transitions. [2022-12-14 10:30:08,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 176 states, 176 states have (on average 2.960227272727273) internal successors, (521), 176 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:30:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1919 transitions. [2022-12-14 10:30:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2022-12-14 10:30:08,623 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:30:08,624 INFO L195 NwaCegarLoop]: trace histogram [545, 545, 544, 32, 31, 31, 1, 1] [2022-12-14 10:30:08,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-14 10:30:08,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:30:08,825 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:30:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:30:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1349579938, now seen corresponding path program 21 times [2022-12-14 10:30:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:30:08,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826352657] [2022-12-14 10:30:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:30:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:30:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:30:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 196118 proven. 2988 refuted. 0 times theorem prover too weak. 263935 trivial. 0 not checked. [2022-12-14 10:30:18,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:30:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826352657] [2022-12-14 10:30:18,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826352657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:30:18,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311276337] [2022-12-14 10:30:18,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:30:18,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:30:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:30:18,853 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:30:18,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 10:31:40,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:31:40,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:31:40,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 7030 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 10:31:40,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:31:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 370181 proven. 26173 refuted. 0 times theorem prover too weak. 66687 trivial. 0 not checked. [2022-12-14 10:31:42,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:31:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 463041 backedges. 370181 proven. 26173 refuted. 0 times theorem prover too weak. 66687 trivial. 0 not checked. [2022-12-14 10:31:45,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311276337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:31:45,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362561732] [2022-12-14 10:31:45,100 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:31:45,100 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:31:45,100 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:31:45,101 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:31:45,101 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:31:45,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:31:45,109 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:31:45,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:31:45,191 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:31:45,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:31:45,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:31:45,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:31:45,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:31:45,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:31:45,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:31:45,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:31:45,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:31:45,421 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:31:45,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:31:45,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:31:45,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:31:45,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:31:45,521 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:31:45,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:31:45,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:31:45,562 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:31:46,157 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '140640#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= 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|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:31:46,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:31:46,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:31:46,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 52, 52] total 131 [2022-12-14 10:31:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740957929] [2022-12-14 10:31:46,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:31:46,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-12-14 10:31:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:31:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-12-14 10:31:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2622, Invalid=16010, Unknown=0, NotChecked=0, Total=18632 [2022-12-14 10:31:46,161 INFO L87 Difference]: Start difference. First operand 1875 states and 1919 transitions. Second operand has 131 states, 131 states have (on average 3.564885496183206) internal successors, (467), 131 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:32:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:11,920 INFO L93 Difference]: Finished difference Result 1875 states and 1910 transitions. [2022-12-14 10:32:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 403 states. [2022-12-14 10:32:11,920 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 3.564885496183206) internal successors, (467), 131 states have internal predecessors, (467), 0 states have call successors, (0), 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 [2022-12-14 10:32:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:11,923 INFO L225 Difference]: With dead ends: 1875 [2022-12-14 10:32:11,923 INFO L226 Difference]: Without dead ends: 1875 [2022-12-14 10:32:11,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5620 GetRequests, 5085 SyntacticMatches, 25 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72988 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=43150, Invalid=218482, Unknown=0, NotChecked=0, Total=261632 [2022-12-14 10:32:11,932 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16094 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 16094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:11,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 16130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 16094 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-12-14 10:32:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-12-14 10:32:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2022-12-14 10:32:11,941 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) [2022-12-14 10:32:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1910 transitions. [2022-12-14 10:32:11,942 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1910 transitions. Word has length 1730 [2022-12-14 10:32:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:11,943 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 1910 transitions. [2022-12-14 10:32:11,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 3.564885496183206) internal successors, (467), 131 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:32:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1910 transitions. [2022-12-14 10:32:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1746 [2022-12-14 10:32:11,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:11,959 INFO L195 NwaCegarLoop]: trace histogram [550, 550, 549, 32, 31, 31, 1, 1] [2022-12-14 10:32:11,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 10:32:12,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-14 10:32:12,161 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:32:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2102488769, now seen corresponding path program 22 times [2022-12-14 10:32:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:12,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736097778] [2022-12-14 10:32:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 471401 backedges. 200560 proven. 3225 refuted. 0 times theorem prover too weak. 267616 trivial. 0 not checked. [2022-12-14 10:32:22,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:22,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736097778] [2022-12-14 10:32:22,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736097778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:22,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051103662] [2022-12-14 10:32:22,698 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:32:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:22,699 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:22,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 10:32:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:23,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 7085 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 10:32:23,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 471401 backedges. 386887 proven. 29326 refuted. 0 times theorem prover too weak. 55188 trivial. 0 not checked. [2022-12-14 10:32:25,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:32:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 471401 backedges. 386887 proven. 29326 refuted. 0 times theorem prover too weak. 55188 trivial. 0 not checked. [2022-12-14 10:32:28,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051103662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:32:28,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854721155] [2022-12-14 10:32:28,190 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:32:28,190 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:32:28,190 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:32:28,190 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:32:28,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:32:28,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:28,198 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:32:28,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:32:28,298 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:32:28,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 231 [2022-12-14 10:32:28,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:32:28,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:32:28,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:32:28,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:32:28,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:32:28,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:32:28,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:32:28,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:32:28,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:32:28,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:32:28,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:32:28,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:32:28,718 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:32:29,731 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '155747#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:32:29,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:32:29,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:32:29,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 54, 54] total 136 [2022-12-14 10:32:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165279950] [2022-12-14 10:32:29,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:32:29,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-12-14 10:32:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-12-14 10:32:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2816, Invalid=17206, Unknown=0, NotChecked=0, Total=20022 [2022-12-14 10:32:29,734 INFO L87 Difference]: Start difference. First operand 1875 states and 1910 transitions. Second operand has 136 states, 136 states have (on average 3.5661764705882355) internal successors, (485), 136 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:32:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:57,222 INFO L93 Difference]: Finished difference Result 1875 states and 1902 transitions. [2022-12-14 10:32:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 432 states. [2022-12-14 10:32:57,222 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 3.5661764705882355) internal successors, (485), 136 states have internal predecessors, (485), 0 states have call successors, (0), 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 [2022-12-14 10:32:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:57,225 INFO L225 Difference]: With dead ends: 1875 [2022-12-14 10:32:57,225 INFO L226 Difference]: Without dead ends: 1875 [2022-12-14 10:32:57,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5695 GetRequests, 5126 SyntacticMatches, 26 SemanticMatches, 543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82902 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=48917, Invalid=247563, Unknown=0, NotChecked=0, Total=296480 [2022-12-14 10:32:57,236 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17615 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 17615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:57,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 17654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 17615 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 10:32:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-12-14 10:32:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2022-12-14 10:32:57,244 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) [2022-12-14 10:32:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1902 transitions. [2022-12-14 10:32:57,245 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1902 transitions. Word has length 1745 [2022-12-14 10:32:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:57,245 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 1902 transitions. [2022-12-14 10:32:57,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 136 states have (on average 3.5661764705882355) internal successors, (485), 136 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:32:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1902 transitions. [2022-12-14 10:32:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2022-12-14 10:32:57,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:57,262 INFO L195 NwaCegarLoop]: trace histogram [554, 554, 553, 32, 31, 31, 1, 1] [2022-12-14 10:32:57,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 10:32:57,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-14 10:32:57,463 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:32:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2146284759, now seen corresponding path program 23 times [2022-12-14 10:32:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:57,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002431431] [2022-12-14 10:32:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:33:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 204587 proven. 3471 refuted. 0 times theorem prover too weak. 270085 trivial. 0 not checked. [2022-12-14 10:33:08,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:33:08,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002431431] [2022-12-14 10:33:08,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002431431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:33:08,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862319381] [2022-12-14 10:33:08,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:33:08,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:08,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:33:08,682 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:33:08,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 10:33:30,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2022-12-14 10:33:30,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:33:30,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 2255 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 10:33:30,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:33:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 165795 proven. 18177 refuted. 0 times theorem prover too weak. 294171 trivial. 0 not checked. [2022-12-14 10:33:33,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:33:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 478143 backedges. 165795 proven. 18177 refuted. 0 times theorem prover too weak. 294171 trivial. 0 not checked. [2022-12-14 10:33:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862319381] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:33:36,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [791869640] [2022-12-14 10:33:36,632 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:33:36,632 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:33:36,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:33:36,633 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:33:36,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:33:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:36,641 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:33:36,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:33:36,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:33:36,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:33:36,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:33:36,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:33:36,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:33:36,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:33:36,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:33:36,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:33:36,956 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:33:36,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:33:36,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:33:37,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:33:37,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:33:37,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:33:37,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:33:37,111 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:33:38,086 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '171034#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= |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|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:33:38,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:33:38,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:33:38,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 67, 67] total 188 [2022-12-14 10:33:38,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726723971] [2022-12-14 10:33:38,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:33:38,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 188 states [2022-12-14 10:33:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:33:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2022-12-14 10:33:38,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4626, Invalid=32816, Unknown=0, NotChecked=0, Total=37442 [2022-12-14 10:33:38,091 INFO L87 Difference]: Start difference. First operand 1875 states and 1902 transitions. Second operand has 188 states, 188 states have (on average 3.021276595744681) internal successors, (568), 188 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:33:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:33:50,685 INFO L93 Difference]: Finished difference Result 2267 states and 2299 transitions. [2022-12-14 10:33:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 315 states. [2022-12-14 10:33:50,686 INFO L78 Accepts]: Start accepts. Automaton has has 188 states, 188 states have (on average 3.021276595744681) internal successors, (568), 188 states have internal predecessors, (568), 0 states have call successors, (0), 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 [2022-12-14 10:33:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:33:50,689 INFO L225 Difference]: With dead ends: 2267 [2022-12-14 10:33:50,689 INFO L226 Difference]: Without dead ends: 2267 [2022-12-14 10:33:50,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5641 GetRequests, 5136 SyntacticMatches, 2 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77296 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=34523, Invalid=219997, Unknown=0, NotChecked=0, Total=254520 [2022-12-14 10:33:50,698 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1576 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6069 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 6069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:33:50,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 0 Invalid, 6280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 6069 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 10:33:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-12-14 10:33:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1875. [2022-12-14 10:33:50,707 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) [2022-12-14 10:33:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1895 transitions. [2022-12-14 10:33:50,708 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1895 transitions. Word has length 1757 [2022-12-14 10:33:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:33:50,709 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 1895 transitions. [2022-12-14 10:33:50,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 188 states, 188 states have (on average 3.021276595744681) internal successors, (568), 188 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:33:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1895 transitions. [2022-12-14 10:33:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1773 [2022-12-14 10:33:50,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:33:50,726 INFO L195 NwaCegarLoop]: trace histogram [559, 559, 558, 32, 31, 31, 1, 1] [2022-12-14 10:33:50,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-14 10:33:50,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-14 10:33:50,927 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:33:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:33:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1601380546, now seen corresponding path program 24 times [2022-12-14 10:33:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:33:50,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397675223] [2022-12-14 10:33:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:33:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:33:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 486638 backedges. 413166 proven. 38087 refuted. 0 times theorem prover too weak. 35385 trivial. 0 not checked. [2022-12-14 10:34:01,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397675223] [2022-12-14 10:34:01,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397675223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377237263] [2022-12-14 10:34:01,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:34:01,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:01,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:01,394 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:01,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 10:35:05,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:35:05,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:35:05,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 7184 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 10:35:05,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:35:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 486638 backedges. 414883 proven. 36370 refuted. 0 times theorem prover too weak. 35385 trivial. 0 not checked. [2022-12-14 10:35:06,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:35:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 486638 backedges. 414883 proven. 36370 refuted. 0 times theorem prover too weak. 35385 trivial. 0 not checked. [2022-12-14 10:35:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377237263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:35:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452103467] [2022-12-14 10:35:09,220 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 10:35:09,220 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:35:09,220 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:35:09,220 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:35:09,221 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:35:09,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:35:09,228 INFO L350 Elim1Store]: Elim1 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 [2022-12-14 10:35:09,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 237 [2022-12-14 10:35:09,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:35:09,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:35:09,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2022-12-14 10:35:09,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 10:35:09,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 10:35:09,626 INFO L321 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2022-12-14 10:35:09,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 117 [2022-12-14 10:35:09,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2022-12-14 10:35:09,674 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:35:10,289 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '186549#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (not (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|))) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (< (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 33) (= |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|) (<= 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|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|) (= |#NULL.base| 0))' at error location [2022-12-14 10:35:10,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:35:10,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:35:10,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 117 [2022-12-14 10:35:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080787436] [2022-12-14 10:35:10,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:35:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-12-14 10:35:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-12-14 10:35:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2790, Invalid=12462, Unknown=0, NotChecked=0, Total=15252 [2022-12-14 10:35:10,292 INFO L87 Difference]: Start difference. First operand 1875 states and 1895 transitions. Second operand has 118 states, 118 states have (on average 3.6864406779661016) internal successors, (435), 117 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:35:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:26,188 INFO L93 Difference]: Finished difference Result 1875 states and 1889 transitions. [2022-12-14 10:35:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 465 states. [2022-12-14 10:35:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 118 states have (on average 3.6864406779661016) internal successors, (435), 117 states have internal predecessors, (435), 0 states have call successors, (0), 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 [2022-12-14 10:35:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:26,191 INFO L225 Difference]: With dead ends: 1875 [2022-12-14 10:35:26,191 INFO L226 Difference]: Without dead ends: 1875 [2022-12-14 10:35:26,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5806 GetRequests, 5222 SyntacticMatches, 28 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105992 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=86865, Invalid=223941, Unknown=0, NotChecked=0, Total=310806 [2022-12-14 10:35:26,203 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3891 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:26,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3891 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 10:35:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-12-14 10:35:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2022-12-14 10:35:26,211 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) [2022-12-14 10:35:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1889 transitions. [2022-12-14 10:35:26,212 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1889 transitions. Word has length 1772 [2022-12-14 10:35:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:35:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 1889 transitions. [2022-12-14 10:35:26,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 3.6864406779661016) internal successors, (435), 117 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:35:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1889 transitions. [2022-12-14 10:35:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1776 [2022-12-14 10:35:26,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:26,229 INFO L195 NwaCegarLoop]: trace histogram [560, 560, 559, 32, 31, 31, 1, 1] [2022-12-14 10:35:26,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-14 10:35:26,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:35:26,431 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-12-14 10:35:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash 114463137, now seen corresponding path program 25 times [2022-12-14 10:35:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690354383] [2022-12-14 10:35:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 10:35:29,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 10:35:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 10:35:33,015 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 10:35:33,015 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 10:35:33,016 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 8 remaining) [2022-12-14 10:35:33,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (6 of 8 remaining) [2022-12-14 10:35:33,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2022-12-14 10:35:33,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2022-12-14 10:35:33,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2022-12-14 10:35:33,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2022-12-14 10:35:33,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2022-12-14 10:35:33,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-12-14 10:35:33,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-14 10:35:33,020 INFO L445 BasicCegarLoop]: Path program histogram: [25, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:35:33,024 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 10:35:33,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:35:33 BoogieIcfgContainer [2022-12-14 10:35:33,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 10:35:33,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 10:35:33,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 10:35:33,338 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 10:35:33,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:22:55" (3/4) ... [2022-12-14 10:35:33,340 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 10:35:33,639 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 10:35:33,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 10:35:33,640 INFO L158 Benchmark]: Toolchain (without parser) took 758396.22ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 78.9MB in the beginning and 337.3MB in the end (delta: -258.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.60ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 69.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.31ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 67.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 INFO L158 Benchmark]: Boogie Preprocessor took 22.91ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 66.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 INFO L158 Benchmark]: RCFGBuilder took 298.13ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 52.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 INFO L158 Benchmark]: TraceAbstraction took 757554.06ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 52.0MB in the beginning and 435.3MB in the end (delta: -383.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 INFO L158 Benchmark]: Witness Printer took 301.61ms. Allocated memory is still 1.6GB. Free memory was 435.3MB in the beginning and 337.3MB in the end (delta: 98.1MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2022-12-14 10:35:33,640 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.13ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.60ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 69.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.31ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 67.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.91ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 66.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.13ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 52.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 757554.06ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 52.0MB in the beginning and 435.3MB in the end (delta: -383.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 301.61ms. Allocated memory is still 1.6GB. Free memory was 435.3MB in the beginning and 337.3MB in the end (delta: 98.1MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: 757.2s, OverallIterations: 47, TraceHistogramMax: 560, PathProgramHistogramMax: 25, EmptinessCheckTime: 0.2s, AutomataDifference: 238.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12403 SdHoareTripleChecker+Valid, 40.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12403 mSDsluCounter, 380 SdHoareTripleChecker+Invalid, 34.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 1902 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126955 IncrementalHoareTripleChecker+Invalid, 128887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1902 mSolverCounterUnsat, 124 mSDtfsCounter, 126955 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67874 GetRequests, 59640 SyntacticMatches, 290 SemanticMatches, 7944 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1082202 ImplicationChecksByTransitivity, 251.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2313occurred in iteration=40, InterpolantAutomatonStates: 5823, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 46 MinimizatonAttempts, 2882 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.1s SsaConstructionTime, 299.0s SatisfiabilityAnalysisTime, 160.6s InterpolantComputationTime, 42989 NumberOfCodeBlocks, 38147 NumberOfCodeBlocksAsserted, 270 NumberOfCheckSat, 61557 ConstructedInterpolants, 59 QuantifiedInterpolants, 196677 SizeOfPredicates, 196 NumberOfNonLiveVariables, 66773 ConjunctsInSsa, 1164 ConjunctsInUnsatCore, 122 InterpolantComputations, 10 PerfectInterpolantSequences, 10442875/11810247 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.4s, 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.3s, 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.3s, 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.0s, 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.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, 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! [2022-12-14 10:35:33,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fab7e8a-8953-41ff-a006-7a299e767f6f/bin/utaipan-gh47qXpMRh/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)