./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aaf3ef5b6218ff6658a67703b1e3ffb0d16a40e5e7c9a13354b853d6f63747b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:00:54,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:00:54,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:00:54,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:00:54,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:00:54,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:00:54,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:00:54,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:00:54,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:00:54,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:00:54,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:00:54,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:00:54,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:00:54,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:00:54,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:00:54,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:00:54,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:00:54,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:00:54,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:00:54,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:00:54,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:00:54,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:00:54,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:00:54,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:00:54,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:00:54,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:00:54,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:00:54,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:00:54,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:00:54,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:00:54,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:00:54,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:00:54,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:00:54,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:00:54,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:00:54,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:00:54,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:00:54,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:00:54,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:00:54,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:00:54,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:00:54,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:00:54,243 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:00:54,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:00:54,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:00:54,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:00:54,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:00:54,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:00:54,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:00:54,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:00:54,246 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:00:54,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:00:54,247 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:00:54,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:00:54,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:00:54,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:00:54,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:00:54,247 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:00:54,247 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:00:54,248 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:00:54,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:00:54,248 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:00:54,248 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:00:54,248 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:00:54,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:00:54,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:00:54,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:00:54,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:00:54,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:00:54,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:00:54,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:00:54,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:00:54,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:00:54,250 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aaf3ef5b6218ff6658a67703b1e3ffb0d16a40e5e7c9a13354b853d6f63747b [2021-12-18 21:00:54,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:00:54,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:00:54,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:00:54,442 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:00:54,442 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:00:54,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2021-12-18 21:00:54,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d069abcea/df4d6fd91d2141bb97cc001ca98e010d/FLAG9c9f58562 [2021-12-18 21:00:54,842 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:00:54,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2021-12-18 21:00:54,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d069abcea/df4d6fd91d2141bb97cc001ca98e010d/FLAG9c9f58562 [2021-12-18 21:00:54,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d069abcea/df4d6fd91d2141bb97cc001ca98e010d [2021-12-18 21:00:54,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:00:54,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:00:54,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:00:54,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:00:54,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:00:54,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:00:54" (1/1) ... [2021-12-18 21:00:54,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de61e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:54, skipping insertion in model container [2021-12-18 21:00:54,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:00:54" (1/1) ... [2021-12-18 21:00:54,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:00:54,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:00:54,995 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:00:55,000 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:00:55,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:00:55,018 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:00:55,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55 WrapperNode [2021-12-18 21:00:55,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:00:55,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:00:55,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:00:55,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:00:55,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,047 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2021-12-18 21:00:55,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:00:55,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:00:55,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:00:55,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:00:55,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:00:55,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:00:55,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:00:55,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:00:55,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (1/1) ... [2021-12-18 21:00:55,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:00:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:00:55,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 21:00:55,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 21:00:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 21:00:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:00:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:00:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 21:00:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 21:00:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:00:55,178 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:00:55,180 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:00:55,329 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:00:55,333 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:00:55,333 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-18 21:00:55,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:00:55 BoogieIcfgContainer [2021-12-18 21:00:55,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:00:55,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:00:55,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:00:55,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:00:55,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:00:54" (1/3) ... [2021-12-18 21:00:55,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59303ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:00:55, skipping insertion in model container [2021-12-18 21:00:55,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:55" (2/3) ... [2021-12-18 21:00:55,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59303ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:00:55, skipping insertion in model container [2021-12-18 21:00:55,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:00:55" (3/3) ... [2021-12-18 21:00:55,340 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-read.c [2021-12-18 21:00:55,343 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:00:55,344 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-12-18 21:00:55,396 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:00:55,400 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 21:00:55,400 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-12-18 21:00:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 21:00:55,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:55,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 21:00:55,451 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 28698920, now seen corresponding path program 1 times [2021-12-18 21:00:55,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:55,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414950210] [2021-12-18 21:00:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:55,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:55,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414950210] [2021-12-18 21:00:55,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414950210] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:55,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:55,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:00:55,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586469195] [2021-12-18 21:00:55,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:55,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:00:55,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:00:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:00:55,646 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:55,694 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2021-12-18 21:00:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:00:55,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 21:00:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:55,701 INFO L225 Difference]: With dead ends: 59 [2021-12-18 21:00:55,701 INFO L226 Difference]: Without dead ends: 55 [2021-12-18 21:00:55,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:00:55,707 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:55,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-18 21:00:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2021-12-18 21:00:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-12-18 21:00:55,735 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 5 [2021-12-18 21:00:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:55,735 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-12-18 21:00:55,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-12-18 21:00:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 21:00:55,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:55,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 21:00:55,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 21:00:55,736 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:55,742 INFO L85 PathProgramCache]: Analyzing trace with hash 889631015, now seen corresponding path program 1 times [2021-12-18 21:00:55,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:55,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661002263] [2021-12-18 21:00:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:55,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:55,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:55,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661002263] [2021-12-18 21:00:55,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661002263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:55,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:55,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:00:55,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344199889] [2021-12-18 21:00:55,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:55,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:00:55,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:00:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:00:55,801 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:55,836 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2021-12-18 21:00:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:00:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 21:00:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:55,837 INFO L225 Difference]: With dead ends: 58 [2021-12-18 21:00:55,837 INFO L226 Difference]: Without dead ends: 58 [2021-12-18 21:00:55,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:00:55,842 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:55,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-18 21:00:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2021-12-18 21:00:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-12-18 21:00:55,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 6 [2021-12-18 21:00:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:55,852 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-18 21:00:55,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-12-18 21:00:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 21:00:55,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:55,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 21:00:55,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 21:00:55,854 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:55,857 INFO L85 PathProgramCache]: Analyzing trace with hash 889666573, now seen corresponding path program 1 times [2021-12-18 21:00:55,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:55,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870333097] [2021-12-18 21:00:55,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:55,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:55,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:55,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870333097] [2021-12-18 21:00:55,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870333097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:55,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:55,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:00:55,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145387052] [2021-12-18 21:00:55,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:55,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:00:55,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:00:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:00:55,917 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:55,964 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-12-18 21:00:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:00:55,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) 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 6 [2021-12-18 21:00:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:55,967 INFO L225 Difference]: With dead ends: 32 [2021-12-18 21:00:55,967 INFO L226 Difference]: Without dead ends: 32 [2021-12-18 21:00:55,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:00:55,972 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:55,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-18 21:00:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-18 21:00:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-18 21:00:55,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 6 [2021-12-18 21:00:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:55,980 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-18 21:00:55,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-18 21:00:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 21:00:55,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:55,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 21:00:55,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 21:00:55,981 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:55,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 889666574, now seen corresponding path program 1 times [2021-12-18 21:00:55,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:55,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979278755] [2021-12-18 21:00:55,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:55,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:56,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979278755] [2021-12-18 21:00:56,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979278755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:56,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:56,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:00:56,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622797110] [2021-12-18 21:00:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:56,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:00:56,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:56,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:00:56,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:00:56,041 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:56,080 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-12-18 21:00:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:00:56,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) 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 6 [2021-12-18 21:00:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:56,081 INFO L225 Difference]: With dead ends: 55 [2021-12-18 21:00:56,081 INFO L226 Difference]: Without dead ends: 55 [2021-12-18 21:00:56,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:00:56,082 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:56,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 32 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-18 21:00:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2021-12-18 21:00:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-12-18 21:00:56,084 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 6 [2021-12-18 21:00:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:56,084 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-18 21:00:56,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-12-18 21:00:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 21:00:56,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:56,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:56,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 21:00:56,085 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1809810359, now seen corresponding path program 1 times [2021-12-18 21:00:56,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:56,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523971545] [2021-12-18 21:00:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:56,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:56,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523971545] [2021-12-18 21:00:56,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523971545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:56,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:56,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:00:56,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38568524] [2021-12-18 21:00:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:56,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:00:56,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:00:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:00:56,133 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:56,206 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2021-12-18 21:00:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:00:56,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 21:00:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:56,207 INFO L225 Difference]: With dead ends: 60 [2021-12-18 21:00:56,207 INFO L226 Difference]: Without dead ends: 60 [2021-12-18 21:00:56,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:00:56,208 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:56,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 45 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:00:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-18 21:00:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2021-12-18 21:00:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-12-18 21:00:56,210 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 7 [2021-12-18 21:00:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:56,210 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-12-18 21:00:56,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-12-18 21:00:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 21:00:56,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:56,211 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:56,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 21:00:56,211 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1480744241, now seen corresponding path program 1 times [2021-12-18 21:00:56,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:56,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003544591] [2021-12-18 21:00:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:56,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:56,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003544591] [2021-12-18 21:00:56,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003544591] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:00:56,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87793139] [2021-12-18 21:00:56,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:56,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:56,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:00:56,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:00:56,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 21:00:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:56,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 21:00:56,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:00:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:00:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87793139] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:00:56,376 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:00:56,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-18 21:00:56,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49015876] [2021-12-18 21:00:56,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:00:56,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:00:56,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:00:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:00:56,377 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:56,425 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2021-12-18 21:00:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:00:56,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 21:00:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:56,427 INFO L225 Difference]: With dead ends: 130 [2021-12-18 21:00:56,427 INFO L226 Difference]: Without dead ends: 130 [2021-12-18 21:00:56,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:00:56,428 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 143 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:56,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 143 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-18 21:00:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 48. [2021-12-18 21:00:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2021-12-18 21:00:56,432 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 10 [2021-12-18 21:00:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:56,432 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2021-12-18 21:00:56,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2021-12-18 21:00:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:00:56,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:56,433 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:56,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 21:00:56,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-18 21:00:56,648 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1341568839, now seen corresponding path program 1 times [2021-12-18 21:00:56,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:56,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694854356] [2021-12-18 21:00:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:56,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:56,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694854356] [2021-12-18 21:00:56,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694854356] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:00:56,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444037065] [2021-12-18 21:00:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:56,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:00:56,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:00:56,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 21:00:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:56,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 21:00:56,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:00:56,810 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:00:56,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:00:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:00:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:56,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444037065] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:00:56,948 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:00:56,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-18 21:00:56,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170875233] [2021-12-18 21:00:56,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:00:56,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:00:56,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:56,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:00:56,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:00:56,949 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:57,121 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2021-12-18 21:00:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:00:57,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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 11 [2021-12-18 21:00:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:57,123 INFO L225 Difference]: With dead ends: 129 [2021-12-18 21:00:57,123 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 21:00:57,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-12-18 21:00:57,123 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 396 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:57,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 100 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:00:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 21:00:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 49. [2021-12-18 21:00:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-12-18 21:00:57,126 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 11 [2021-12-18 21:00:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:57,126 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-12-18 21:00:57,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2021-12-18 21:00:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:00:57,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:57,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:57,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 21:00:57,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-18 21:00:57,344 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1361088610, now seen corresponding path program 1 times [2021-12-18 21:00:57,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:57,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168546828] [2021-12-18 21:00:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:57,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:57,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:57,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168546828] [2021-12-18 21:00:57,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168546828] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:00:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109097171] [2021-12-18 21:00:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:57,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:57,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:00:57,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:00:57,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 21:00:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:57,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:00:57,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:00:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:57,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:00:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:57,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109097171] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:00:57,509 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:00:57,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-18 21:00:57,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956880573] [2021-12-18 21:00:57,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:00:57,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:00:57,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:00:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:00:57,511 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:57,621 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2021-12-18 21:00:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:00:57,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 21:00:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:57,622 INFO L225 Difference]: With dead ends: 88 [2021-12-18 21:00:57,622 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 21:00:57,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-12-18 21:00:57,623 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 127 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:57,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 62 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:00:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 21:00:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 48. [2021-12-18 21:00:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2021-12-18 21:00:57,625 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 12 [2021-12-18 21:00:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:57,625 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2021-12-18 21:00:57,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2021-12-18 21:00:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:00:57,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:57,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:57,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 21:00:57,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:57,839 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:57,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 4840471, now seen corresponding path program 2 times [2021-12-18 21:00:57,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:57,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704911370] [2021-12-18 21:00:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:57,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 21:00:57,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:57,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704911370] [2021-12-18 21:00:57,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704911370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:57,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:57,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:00:57,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035348947] [2021-12-18 21:00:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:57,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:00:57,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:57,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:00:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:00:57,902 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:57,916 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2021-12-18 21:00:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:00:57,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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 17 [2021-12-18 21:00:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:57,917 INFO L225 Difference]: With dead ends: 46 [2021-12-18 21:00:57,917 INFO L226 Difference]: Without dead ends: 46 [2021-12-18 21:00:57,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:00:57,919 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:57,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-18 21:00:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-12-18 21:00:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-12-18 21:00:57,928 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 17 [2021-12-18 21:00:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:57,928 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-12-18 21:00:57,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2021-12-18 21:00:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:00:57,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:57,929 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:57,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 21:00:57,930 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 4840472, now seen corresponding path program 1 times [2021-12-18 21:00:57,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:57,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536060752] [2021-12-18 21:00:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:57,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:00:57,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:57,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536060752] [2021-12-18 21:00:57,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536060752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:57,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:57,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:00:57,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741960267] [2021-12-18 21:00:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:57,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:00:57,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:00:57,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:00:57,979 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:58,001 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-18 21:00:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:00:58,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 17 [2021-12-18 21:00:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:58,002 INFO L225 Difference]: With dead ends: 76 [2021-12-18 21:00:58,002 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 21:00:58,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:00:58,002 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:58,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 21:00:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2021-12-18 21:00:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-12-18 21:00:58,005 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 17 [2021-12-18 21:00:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:58,015 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-12-18 21:00:58,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-12-18 21:00:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:00:58,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:58,016 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:58,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 21:00:58,016 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1949815299, now seen corresponding path program 1 times [2021-12-18 21:00:58,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:58,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657481794] [2021-12-18 21:00:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:58,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:00:58,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657481794] [2021-12-18 21:00:58,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657481794] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:00:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329468699] [2021-12-18 21:00:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:58,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:58,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:00:58,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:00:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 21:00:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:58,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:00:58,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:00:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:00:58,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:00:58,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-12-18 21:00:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:00:58,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329468699] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:00:58,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:00:58,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-18 21:00:58,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222804583] [2021-12-18 21:00:58,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:00:58,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:00:58,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:00:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:00:58,349 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:58,406 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-12-18 21:00:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:00:58,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 21:00:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:58,406 INFO L225 Difference]: With dead ends: 80 [2021-12-18 21:00:58,407 INFO L226 Difference]: Without dead ends: 80 [2021-12-18 21:00:58,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:00:58,407 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:58,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 40 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-18 21:00:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2021-12-18 21:00:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-12-18 21:00:58,409 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 23 [2021-12-18 21:00:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:58,409 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-12-18 21:00:58,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-12-18 21:00:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:00:58,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:58,410 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2021-12-18 21:00:58,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 21:00:58,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:58,622 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:58,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash 634835432, now seen corresponding path program 2 times [2021-12-18 21:00:58,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:58,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344640538] [2021-12-18 21:00:58,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:58,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 21:00:58,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:58,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344640538] [2021-12-18 21:00:58,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344640538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:58,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:00:58,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:00:58,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161706711] [2021-12-18 21:00:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:58,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:00:58,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:58,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:00:58,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:00:58,669 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:58,723 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2021-12-18 21:00:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:00:58,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-18 21:00:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:58,724 INFO L225 Difference]: With dead ends: 86 [2021-12-18 21:00:58,724 INFO L226 Difference]: Without dead ends: 86 [2021-12-18 21:00:58,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:00:58,725 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:58,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 65 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:00:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-18 21:00:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2021-12-18 21:00:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2021-12-18 21:00:58,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 25 [2021-12-18 21:00:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:58,728 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2021-12-18 21:00:58,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-12-18 21:00:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 21:00:58,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:58,728 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:58,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 21:00:58,729 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1809865305, now seen corresponding path program 1 times [2021-12-18 21:00:58,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:58,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592000288] [2021-12-18 21:00:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:58,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:00:58,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:58,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592000288] [2021-12-18 21:00:58,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592000288] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:00:58,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659221370] [2021-12-18 21:00:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:58,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:58,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:00:58,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:00:58,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 21:00:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:58,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:00:58,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:00:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 21:00:58,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:00:58,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659221370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:00:58,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 21:00:58,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-18 21:00:58,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804188643] [2021-12-18 21:00:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:00:58,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:00:58,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:00:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:00:58,994 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:58,995 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-12-18 21:00:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:00:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 21:00:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:58,996 INFO L225 Difference]: With dead ends: 62 [2021-12-18 21:00:58,996 INFO L226 Difference]: Without dead ends: 60 [2021-12-18 21:00:58,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:00:58,996 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:58,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2021-12-18 21:00:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-18 21:00:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-18 21:00:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-12-18 21:00:58,998 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 26 [2021-12-18 21:00:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:58,998 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-12-18 21:00:58,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-12-18 21:00:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 21:00:58,999 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:58,999 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:59,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-18 21:00:59,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-18 21:00:59,212 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:00:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:00:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash -271127104, now seen corresponding path program 1 times [2021-12-18 21:00:59,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:00:59,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129582655] [2021-12-18 21:00:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:59,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:00:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 21:00:59,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:00:59,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129582655] [2021-12-18 21:00:59,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129582655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:00:59,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697898629] [2021-12-18 21:00:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:00:59,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:00:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:00:59,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:00:59,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 21:00:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:00:59,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 21:00:59,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:00:59,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:00:59,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:00:59,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:00:59,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-18 21:00:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:59,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:00:59,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-18 21:00:59,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-12-18 21:00:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:00:59,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697898629] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:00:59,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:00:59,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 21 [2021-12-18 21:00:59,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956862777] [2021-12-18 21:00:59,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:00:59,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 21:00:59,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:00:59,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 21:00:59,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-12-18 21:00:59,683 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:00:59,886 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-12-18 21:00:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:00:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 21:00:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:00:59,887 INFO L225 Difference]: With dead ends: 101 [2021-12-18 21:00:59,887 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 21:00:59,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2021-12-18 21:00:59,887 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:00:59,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 145 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:00:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 21:00:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 66. [2021-12-18 21:00:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-12-18 21:00:59,889 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 27 [2021-12-18 21:00:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:00:59,889 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-12-18 21:00:59,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:00:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-12-18 21:00:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 21:00:59,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:00:59,890 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-18 21:00:59,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:00,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:00,100 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash 164722723, now seen corresponding path program 1 times [2021-12-18 21:01:00,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:00,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120240089] [2021-12-18 21:01:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:00,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:01:00,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:00,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120240089] [2021-12-18 21:01:00,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120240089] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:00,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464832069] [2021-12-18 21:01:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:00,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:00,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:00,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 21:01:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:01:00,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:01:00,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 21:01:00,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464832069] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:00,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:00,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-18 21:01:00,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404671505] [2021-12-18 21:01:00,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:00,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:01:00,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:01:00,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:01:00,366 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:00,505 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-12-18 21:01:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:01:00,505 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-18 21:01:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:00,506 INFO L225 Difference]: With dead ends: 66 [2021-12-18 21:01:00,506 INFO L226 Difference]: Without dead ends: 66 [2021-12-18 21:01:00,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:01:00,507 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 107 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:00,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 42 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:01:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-18 21:01:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-12-18 21:01:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-12-18 21:01:00,509 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 34 [2021-12-18 21:01:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:00,509 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-12-18 21:01:00,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-12-18 21:01:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 21:01:00,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:00,510 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-18 21:01:00,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:00,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:00,719 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash 882673172, now seen corresponding path program 2 times [2021-12-18 21:01:00,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:00,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544706583] [2021-12-18 21:01:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:00,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:00,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:00,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544706583] [2021-12-18 21:01:00,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544706583] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:00,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187411033] [2021-12-18 21:01:00,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:01:00,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:00,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:00,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 21:01:00,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:01:00,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:00,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-18 21:01:00,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:00,896 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:01:00,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:01:00,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 21:01:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:01,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:01,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187411033] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:01,258 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:01,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2021-12-18 21:01:01,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148914522] [2021-12-18 21:01:01,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:01,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:01:01,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:01:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:01:01,259 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:01,334 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2021-12-18 21:01:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:01:01,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-18 21:01:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:01,335 INFO L225 Difference]: With dead ends: 158 [2021-12-18 21:01:01,335 INFO L226 Difference]: Without dead ends: 158 [2021-12-18 21:01:01,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:01:01,336 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:01,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 81 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:01:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-18 21:01:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2021-12-18 21:01:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.1517241379310346) internal successors, (167), 149 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2021-12-18 21:01:01,339 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 39 [2021-12-18 21:01:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:01,339 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2021-12-18 21:01:01,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2021-12-18 21:01:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 21:01:01,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:01,340 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:01:01,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:01,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 21:01:01,556 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash -890031373, now seen corresponding path program 1 times [2021-12-18 21:01:01,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:01,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618111733] [2021-12-18 21:01:01,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:01,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 21:01:01,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:01,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618111733] [2021-12-18 21:01:01,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618111733] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:01,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907038903] [2021-12-18 21:01:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:01,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:01,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:01,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:01,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 21:01:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:01,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 21:01:01,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 21:01:01,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 21:01:01,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907038903] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:01,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:01,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2021-12-18 21:01:01,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251375746] [2021-12-18 21:01:01,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:01,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:01:01,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:01:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:01:01,896 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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) [2021-12-18 21:01:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:02,044 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2021-12-18 21:01:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 21:01:02,045 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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 42 [2021-12-18 21:01:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:02,045 INFO L225 Difference]: With dead ends: 165 [2021-12-18 21:01:02,045 INFO L226 Difference]: Without dead ends: 165 [2021-12-18 21:01:02,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2021-12-18 21:01:02,046 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 176 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:02,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 57 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:01:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-18 21:01:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2021-12-18 21:01:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2021-12-18 21:01:02,049 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 42 [2021-12-18 21:01:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:02,049 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2021-12-18 21:01:02,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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) [2021-12-18 21:01:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2021-12-18 21:01:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-18 21:01:02,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:02,050 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:01:02,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:02,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 21:01:02,259 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -255177540, now seen corresponding path program 2 times [2021-12-18 21:01:02,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:02,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072182091] [2021-12-18 21:01:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:02,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-18 21:01:02,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:02,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072182091] [2021-12-18 21:01:02,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072182091] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:02,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686559582] [2021-12-18 21:01:02,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:01:02,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:02,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:02,302 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:02,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 21:01:02,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:01:02,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:02,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 21:01:02,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:02,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:02,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-18 21:01:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:02,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686559582] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:02,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:02,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2021-12-18 21:01:02,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791655706] [2021-12-18 21:01:02,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:02,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 21:01:02,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 21:01:02,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-12-18 21:01:02,865 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:03,007 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2021-12-18 21:01:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:01:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-12-18 21:01:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:03,008 INFO L225 Difference]: With dead ends: 153 [2021-12-18 21:01:03,008 INFO L226 Difference]: Without dead ends: 153 [2021-12-18 21:01:03,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:01:03,010 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 247 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:03,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 95 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:01:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-18 21:01:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2021-12-18 21:01:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.119718309859155) internal successors, (159), 146 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2021-12-18 21:01:03,015 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 49 [2021-12-18 21:01:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:03,015 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2021-12-18 21:01:03,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2021-12-18 21:01:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-18 21:01:03,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:03,017 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2021-12-18 21:01:03,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:03,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 21:01:03,227 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash 11435127, now seen corresponding path program 2 times [2021-12-18 21:01:03,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:03,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765874981] [2021-12-18 21:01:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:03,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 27 proven. 175 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:03,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765874981] [2021-12-18 21:01:03,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765874981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796248564] [2021-12-18 21:01:03,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:01:03,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:03,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:03,311 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:03,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 21:01:03,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:01:03,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:03,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 21:01:03,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 43 proven. 159 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:03,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 43 proven. 159 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 21:01:03,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796248564] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:03,678 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:03,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2021-12-18 21:01:03,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278290759] [2021-12-18 21:01:03,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:03,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 21:01:03,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:03,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 21:01:03,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:01:03,679 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:04,011 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2021-12-18 21:01:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 21:01:04,011 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-12-18 21:01:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:04,012 INFO L225 Difference]: With dead ends: 199 [2021-12-18 21:01:04,012 INFO L226 Difference]: Without dead ends: 199 [2021-12-18 21:01:04,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=401, Invalid=1005, Unknown=0, NotChecked=0, Total=1406 [2021-12-18 21:01:04,013 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 353 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:04,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 95 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:01:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-18 21:01:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 145. [2021-12-18 21:01:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.1) internal successors, (154), 144 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2021-12-18 21:01:04,015 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 64 [2021-12-18 21:01:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:04,015 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2021-12-18 21:01:04,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2021-12-18 21:01:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 21:01:04,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:04,016 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-18 21:01:04,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:04,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:04,219 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash -867962629, now seen corresponding path program 3 times [2021-12-18 21:01:04,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:04,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156272476] [2021-12-18 21:01:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:04,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 30 proven. 133 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-18 21:01:04,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:04,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156272476] [2021-12-18 21:01:04,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156272476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:04,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473922811] [2021-12-18 21:01:04,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 21:01:04,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:04,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:04,314 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:04,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 21:01:04,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-18 21:01:04,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:04,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 21:01:04,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:04,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:01:04,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 21:01:04,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 21:01:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-18 21:01:04,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:01:04,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473922811] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:01:04,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 21:01:04,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2021-12-18 21:01:04,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057590256] [2021-12-18 21:01:04,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:01:04,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:01:04,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:04,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:01:04,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:01:04,732 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:04,764 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-18 21:01:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:01:04,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 75 [2021-12-18 21:01:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:04,765 INFO L225 Difference]: With dead ends: 143 [2021-12-18 21:01:04,765 INFO L226 Difference]: Without dead ends: 143 [2021-12-18 21:01:04,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:01:04,767 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:04,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:01:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-18 21:01:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2021-12-18 21:01:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 1.0648148148148149) internal successors, (115), 110 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2021-12-18 21:01:04,769 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 75 [2021-12-18 21:01:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:04,769 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2021-12-18 21:01:04,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2021-12-18 21:01:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-18 21:01:04,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:04,770 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:01:04,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:04,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:04,980 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:04,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1660735401, now seen corresponding path program 1 times [2021-12-18 21:01:04,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:04,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612340597] [2021-12-18 21:01:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:04,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 30 proven. 133 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 21:01:05,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:05,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612340597] [2021-12-18 21:01:05,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612340597] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:05,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767754928] [2021-12-18 21:01:05,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:05,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:05,059 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:05,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 21:01:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:05,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 21:01:05,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 57 proven. 106 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 21:01:05,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 57 proven. 106 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 21:01:05,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767754928] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:05,461 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:05,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-18 21:01:05,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276293612] [2021-12-18 21:01:05,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:05,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 21:01:05,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:05,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 21:01:05,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-12-18 21:01:05,463 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:05,693 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2021-12-18 21:01:05,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:01:05,694 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 0 states have call successors, (0), 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 80 [2021-12-18 21:01:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:05,694 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:01:05,694 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:01:05,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2021-12-18 21:01:05,696 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 114 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:05,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 82 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:01:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:01:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2021-12-18 21:01:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 110 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) [2021-12-18 21:01:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2021-12-18 21:01:05,701 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 80 [2021-12-18 21:01:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:05,701 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2021-12-18 21:01:05,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2021-12-18 21:01:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-18 21:01:05,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:05,704 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:01:05,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:05,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-18 21:01:05,907 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 283151040, now seen corresponding path program 2 times [2021-12-18 21:01:05,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574060971] [2021-12-18 21:01:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:05,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-12-18 21:01:05,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:05,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574060971] [2021-12-18 21:01:05,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574060971] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:05,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786327511] [2021-12-18 21:01:05,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:01:05,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:05,971 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:05,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-18 21:01:06,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 21:01:06,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:06,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 21:01:06,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-12-18 21:01:06,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:01:06,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786327511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:01:06,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 21:01:06,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2021-12-18 21:01:06,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249783431] [2021-12-18 21:01:06,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:01:06,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:01:06,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:06,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:01:06,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:01:06,539 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:06,540 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2021-12-18 21:01:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:01:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-18 21:01:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:06,541 INFO L225 Difference]: With dead ends: 110 [2021-12-18 21:01:06,541 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 21:01:06,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:01:06,541 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:06,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2021-12-18 21:01:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 21:01:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-18 21:01:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-12-18 21:01:06,543 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 85 [2021-12-18 21:01:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:06,544 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-12-18 21:01:06,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-12-18 21:01:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-18 21:01:06,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:06,545 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2021-12-18 21:01:06,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:06,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:06,764 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash -875547996, now seen corresponding path program 3 times [2021-12-18 21:01:06,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:06,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503351552] [2021-12-18 21:01:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:06,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 213 proven. 38 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 21:01:06,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:06,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503351552] [2021-12-18 21:01:06,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503351552] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:06,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85930641] [2021-12-18 21:01:06,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 21:01:06,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:06,818 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:06,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-18 21:01:06,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-18 21:01:06,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:06,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 21:01:06,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:06,888 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:01:06,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:01:07,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:01:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 3 proven. 227 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2021-12-18 21:01:07,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2021-12-18 21:01:07,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85930641] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:07,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:07,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2021-12-18 21:01:07,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463455565] [2021-12-18 21:01:07,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:07,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 21:01:07,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 21:01:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:01:07,454 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:07,672 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2021-12-18 21:01:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:01:07,673 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-12-18 21:01:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:07,673 INFO L225 Difference]: With dead ends: 117 [2021-12-18 21:01:07,673 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 21:01:07,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2021-12-18 21:01:07,674 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 204 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:07,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 62 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:01:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 21:01:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2021-12-18 21:01:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-12-18 21:01:07,676 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2021-12-18 21:01:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:07,676 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-12-18 21:01:07,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-12-18 21:01:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-18 21:01:07,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:07,676 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2021-12-18 21:01:07,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:07,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:07,884 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1372184046, now seen corresponding path program 1 times [2021-12-18 21:01:07,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370320067] [2021-12-18 21:01:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:07,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 21:01:07,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:07,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370320067] [2021-12-18 21:01:07,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370320067] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:07,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504035105] [2021-12-18 21:01:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:07,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:07,998 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:07,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-18 21:01:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:08,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 21:01:08,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:08,088 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:01:08,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:01:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 21:01:08,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 21:01:08,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504035105] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:08,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:08,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2021-12-18 21:01:08,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783582889] [2021-12-18 21:01:08,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:08,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-18 21:01:08,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:08,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-18 21:01:08,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:01:08,905 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 19 states, 18 states have (on average 5.222222222222222) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:09,155 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2021-12-18 21:01:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:01:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.222222222222222) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 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 92 [2021-12-18 21:01:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:09,156 INFO L225 Difference]: With dead ends: 159 [2021-12-18 21:01:09,156 INFO L226 Difference]: Without dead ends: 159 [2021-12-18 21:01:09,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2021-12-18 21:01:09,157 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 218 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:09,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 61 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:01:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-18 21:01:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 123. [2021-12-18 21:01:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.0655737704918034) internal successors, (130), 122 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2021-12-18 21:01:09,159 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 92 [2021-12-18 21:01:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:09,159 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2021-12-18 21:01:09,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.222222222222222) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2021-12-18 21:01:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-18 21:01:09,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:09,160 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2021-12-18 21:01:09,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:09,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-18 21:01:09,376 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash -285868558, now seen corresponding path program 2 times [2021-12-18 21:01:09,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63089429] [2021-12-18 21:01:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:09,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 84 proven. 793 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-12-18 21:01:09,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:09,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63089429] [2021-12-18 21:01:09,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63089429] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:09,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554786811] [2021-12-18 21:01:09,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:01:09,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:09,473 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:09,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-18 21:01:09,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:01:09,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:09,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 21:01:09,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 42 proven. 830 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-18 21:01:10,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:10,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-12-18 21:01:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 42 proven. 830 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-18 21:01:11,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554786811] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:11,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:11,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2021-12-18 21:01:11,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109733271] [2021-12-18 21:01:11,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:11,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-18 21:01:11,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:11,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-18 21:01:11,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2021-12-18 21:01:11,327 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand has 37 states, 37 states have (on average 5.648648648648648) internal successors, (209), 37 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:12,437 INFO L93 Difference]: Finished difference Result 167 states and 175 transitions. [2021-12-18 21:01:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-18 21:01:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.648648648648648) internal successors, (209), 37 states have internal predecessors, (209), 0 states have call successors, (0), 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 122 [2021-12-18 21:01:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:12,438 INFO L225 Difference]: With dead ends: 167 [2021-12-18 21:01:12,438 INFO L226 Difference]: Without dead ends: 167 [2021-12-18 21:01:12,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1268, Invalid=4432, Unknown=0, NotChecked=0, Total=5700 [2021-12-18 21:01:12,453 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 183 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:12,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 123 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:01:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-18 21:01:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2021-12-18 21:01:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.0584415584415585) internal successors, (163), 154 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2021-12-18 21:01:12,467 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 122 [2021-12-18 21:01:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:12,469 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2021-12-18 21:01:12,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.648648648648648) internal successors, (209), 37 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2021-12-18 21:01:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-18 21:01:12,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:12,470 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2021-12-18 21:01:12,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:12,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:12,675 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1906495009, now seen corresponding path program 3 times [2021-12-18 21:01:12,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:12,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118263525] [2021-12-18 21:01:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:12,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 865 proven. 297 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2021-12-18 21:01:12,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:12,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118263525] [2021-12-18 21:01:12,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118263525] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:12,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146429463] [2021-12-18 21:01:12,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 21:01:12,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:12,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:12,778 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:12,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-18 21:01:12,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-12-18 21:01:12,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:12,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 21:01:12,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 936 proven. 249 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-18 21:01:13,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 807 proven. 378 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-18 21:01:13,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146429463] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:13,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:13,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 36 [2021-12-18 21:01:13,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660784218] [2021-12-18 21:01:13,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:13,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-18 21:01:13,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:13,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-18 21:01:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2021-12-18 21:01:13,668 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand has 36 states, 36 states have (on average 5.277777777777778) internal successors, (190), 36 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:14,408 INFO L93 Difference]: Finished difference Result 161 states and 167 transitions. [2021-12-18 21:01:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-18 21:01:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.277777777777778) internal successors, (190), 36 states have internal predecessors, (190), 0 states have call successors, (0), 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 149 [2021-12-18 21:01:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:14,409 INFO L225 Difference]: With dead ends: 161 [2021-12-18 21:01:14,409 INFO L226 Difference]: Without dead ends: 161 [2021-12-18 21:01:14,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=832, Invalid=3328, Unknown=0, NotChecked=0, Total=4160 [2021-12-18 21:01:14,410 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 472 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:14,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 76 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:01:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-18 21:01:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2021-12-18 21:01:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.0454545454545454) internal successors, (161), 154 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2021-12-18 21:01:14,412 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 149 [2021-12-18 21:01:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:14,413 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2021-12-18 21:01:14,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.277777777777778) internal successors, (190), 36 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2021-12-18 21:01:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-18 21:01:14,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:14,414 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2021-12-18 21:01:14,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-18 21:01:14,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:14,632 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -874087090, now seen corresponding path program 4 times [2021-12-18 21:01:14,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943841524] [2021-12-18 21:01:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:14,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 118 proven. 1328 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-12-18 21:01:14,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943841524] [2021-12-18 21:01:14,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943841524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:14,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067404131] [2021-12-18 21:01:14,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 21:01:14,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:14,757 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:14,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-18 21:01:14,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 21:01:14,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:14,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-18 21:01:14,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 283 proven. 1201 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-18 21:01:15,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 283 proven. 1201 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-18 21:01:15,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067404131] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:15,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:15,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 35 [2021-12-18 21:01:15,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351250756] [2021-12-18 21:01:15,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:15,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-18 21:01:15,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:15,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-18 21:01:15,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=857, Unknown=0, NotChecked=0, Total=1190 [2021-12-18 21:01:15,628 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand has 35 states, 35 states have (on average 6.428571428571429) internal successors, (225), 35 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:16,733 INFO L93 Difference]: Finished difference Result 401 states and 422 transitions. [2021-12-18 21:01:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-12-18 21:01:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.428571428571429) internal successors, (225), 35 states have internal predecessors, (225), 0 states have call successors, (0), 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 154 [2021-12-18 21:01:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:16,735 INFO L225 Difference]: With dead ends: 401 [2021-12-18 21:01:16,735 INFO L226 Difference]: Without dead ends: 401 [2021-12-18 21:01:16,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4337 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3118, Invalid=7594, Unknown=0, NotChecked=0, Total=10712 [2021-12-18 21:01:16,737 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 290 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:16,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 84 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:01:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-12-18 21:01:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 390. [2021-12-18 21:01:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.056555269922879) internal successors, (411), 389 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 411 transitions. [2021-12-18 21:01:16,742 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 411 transitions. Word has length 154 [2021-12-18 21:01:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:16,742 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 411 transitions. [2021-12-18 21:01:16,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.428571428571429) internal successors, (225), 35 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 411 transitions. [2021-12-18 21:01:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2021-12-18 21:01:16,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:16,744 INFO L514 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1] [2021-12-18 21:01:16,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-18 21:01:16,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:16,951 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash 747006490, now seen corresponding path program 5 times [2021-12-18 21:01:16,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:16,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148625170] [2021-12-18 21:01:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:16,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6738 backedges. 3878 proven. 218 refuted. 0 times theorem prover too weak. 2642 trivial. 0 not checked. [2021-12-18 21:01:17,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:17,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148625170] [2021-12-18 21:01:17,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148625170] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:17,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692328319] [2021-12-18 21:01:17,209 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-18 21:01:17,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:17,210 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:17,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-18 21:01:17,352 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-12-18 21:01:17,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:17,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 21:01:17,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6738 backedges. 3685 proven. 501 refuted. 0 times theorem prover too weak. 2552 trivial. 0 not checked. [2021-12-18 21:01:17,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6738 backedges. 3798 proven. 388 refuted. 0 times theorem prover too weak. 2552 trivial. 0 not checked. [2021-12-18 21:01:18,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692328319] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:18,402 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:18,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 38 [2021-12-18 21:01:18,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874237183] [2021-12-18 21:01:18,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:18,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 21:01:18,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:18,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 21:01:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2021-12-18 21:01:18,404 INFO L87 Difference]: Start difference. First operand 390 states and 411 transitions. Second operand has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:19,173 INFO L93 Difference]: Finished difference Result 390 states and 405 transitions. [2021-12-18 21:01:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-18 21:01:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 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 314 [2021-12-18 21:01:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:19,175 INFO L225 Difference]: With dead ends: 390 [2021-12-18 21:01:19,175 INFO L226 Difference]: Without dead ends: 390 [2021-12-18 21:01:19,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=866, Invalid=3040, Unknown=0, NotChecked=0, Total=3906 [2021-12-18 21:01:19,177 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 122 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:19,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 89 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:01:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-18 21:01:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2021-12-18 21:01:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.0411311053984575) internal successors, (405), 389 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 405 transitions. [2021-12-18 21:01:19,182 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 405 transitions. Word has length 314 [2021-12-18 21:01:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:19,182 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 405 transitions. [2021-12-18 21:01:19,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 405 transitions. [2021-12-18 21:01:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2021-12-18 21:01:19,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:19,185 INFO L514 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1] [2021-12-18 21:01:19,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:19,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-18 21:01:19,399 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash -525875421, now seen corresponding path program 6 times [2021-12-18 21:01:19,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:19,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298136191] [2021-12-18 21:01:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:19,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8073 backedges. 4649 proven. 311 refuted. 0 times theorem prover too weak. 3113 trivial. 0 not checked. [2021-12-18 21:01:19,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:19,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298136191] [2021-12-18 21:01:19,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298136191] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:19,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474776981] [2021-12-18 21:01:19,648 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-18 21:01:19,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:19,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:19,649 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:19,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-18 21:01:19,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2021-12-18 21:01:19,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:19,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:01:19,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8073 backedges. 4943 proven. 852 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2021-12-18 21:01:20,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8073 backedges. 5125 proven. 670 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2021-12-18 21:01:21,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474776981] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:21,084 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:21,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2021-12-18 21:01:21,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446604316] [2021-12-18 21:01:21,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:21,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 21:01:21,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 21:01:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2021-12-18 21:01:21,086 INFO L87 Difference]: Start difference. First operand 390 states and 405 transitions. Second operand has 43 states, 43 states have (on average 5.232558139534884) internal successors, (225), 43 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:22,139 INFO L93 Difference]: Finished difference Result 390 states and 400 transitions. [2021-12-18 21:01:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-18 21:01:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.232558139534884) internal successors, (225), 43 states have internal predecessors, (225), 0 states have call successors, (0), 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 339 [2021-12-18 21:01:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:22,140 INFO L225 Difference]: With dead ends: 390 [2021-12-18 21:01:22,140 INFO L226 Difference]: Without dead ends: 390 [2021-12-18 21:01:22,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1250, Invalid=4602, Unknown=0, NotChecked=0, Total=5852 [2021-12-18 21:01:22,146 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 136 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:22,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 135 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 21:01:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-18 21:01:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2021-12-18 21:01:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.0282776349614395) internal successors, (400), 389 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 400 transitions. [2021-12-18 21:01:22,152 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 400 transitions. Word has length 339 [2021-12-18 21:01:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:22,153 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 400 transitions. [2021-12-18 21:01:22,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.232558139534884) internal successors, (225), 43 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 400 transitions. [2021-12-18 21:01:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2021-12-18 21:01:22,156 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:22,156 INFO L514 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1] [2021-12-18 21:01:22,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:22,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-18 21:01:22,370 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash -814421421, now seen corresponding path program 7 times [2021-12-18 21:01:22,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:22,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965624133] [2021-12-18 21:01:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:22,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9231 backedges. 5360 proven. 419 refuted. 0 times theorem prover too weak. 3452 trivial. 0 not checked. [2021-12-18 21:01:22,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965624133] [2021-12-18 21:01:22,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965624133] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957640903] [2021-12-18 21:01:22,635 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-18 21:01:22,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:22,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:22,637 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:22,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-18 21:01:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:22,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 21:01:22,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9231 backedges. 6271 proven. 1132 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2021-12-18 21:01:23,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9231 backedges. 6271 proven. 1132 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2021-12-18 21:01:24,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957640903] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:24,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:24,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 41 [2021-12-18 21:01:24,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595492656] [2021-12-18 21:01:24,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:24,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 21:01:24,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 21:01:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1346, Unknown=0, NotChecked=0, Total=1640 [2021-12-18 21:01:24,051 INFO L87 Difference]: Start difference. First operand 390 states and 400 transitions. Second operand has 41 states, 41 states have (on average 6.048780487804878) internal successors, (248), 41 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:25,467 INFO L93 Difference]: Finished difference Result 390 states and 396 transitions. [2021-12-18 21:01:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-12-18 21:01:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.048780487804878) internal successors, (248), 41 states have internal predecessors, (248), 0 states have call successors, (0), 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 359 [2021-12-18 21:01:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:25,470 INFO L225 Difference]: With dead ends: 390 [2021-12-18 21:01:25,470 INFO L226 Difference]: Without dead ends: 390 [2021-12-18 21:01:25,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1270, Invalid=5536, Unknown=0, NotChecked=0, Total=6806 [2021-12-18 21:01:25,473 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 140 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:25,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 160 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 21:01:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-18 21:01:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2021-12-18 21:01:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.0179948586118253) internal successors, (396), 389 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 396 transitions. [2021-12-18 21:01:25,478 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 396 transitions. Word has length 359 [2021-12-18 21:01:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:25,479 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 396 transitions. [2021-12-18 21:01:25,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.048780487804878) internal successors, (248), 41 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 396 transitions. [2021-12-18 21:01:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2021-12-18 21:01:25,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:25,480 INFO L514 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1] [2021-12-18 21:01:25,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-12-18 21:01:25,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:25,681 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1672251698, now seen corresponding path program 8 times [2021-12-18 21:01:25,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:25,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176102660] [2021-12-18 21:01:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:25,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10152 backedges. 5981 proven. 542 refuted. 0 times theorem prover too weak. 3629 trivial. 0 not checked. [2021-12-18 21:01:25,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:25,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176102660] [2021-12-18 21:01:25,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176102660] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:25,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855736006] [2021-12-18 21:01:25,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:01:25,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:25,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:26,000 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:26,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-18 21:01:26,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:01:26,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:26,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:01:26,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10152 backedges. 7207 proven. 1646 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2021-12-18 21:01:26,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10152 backedges. 7207 proven. 1646 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2021-12-18 21:01:27,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855736006] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:27,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:27,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 46 [2021-12-18 21:01:27,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803842919] [2021-12-18 21:01:27,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:27,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-18 21:01:27,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:27,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-18 21:01:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1708, Unknown=0, NotChecked=0, Total=2070 [2021-12-18 21:01:27,559 INFO L87 Difference]: Start difference. First operand 390 states and 396 transitions. Second operand has 46 states, 46 states have (on average 6.086956521739131) internal successors, (280), 46 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:29,290 INFO L93 Difference]: Finished difference Result 390 states and 393 transitions. [2021-12-18 21:01:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-12-18 21:01:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.086956521739131) internal successors, (280), 46 states have internal predecessors, (280), 0 states have call successors, (0), 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 374 [2021-12-18 21:01:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:29,301 INFO L225 Difference]: With dead ends: 390 [2021-12-18 21:01:29,301 INFO L226 Difference]: Without dead ends: 390 [2021-12-18 21:01:29,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1739, Invalid=7767, Unknown=0, NotChecked=0, Total=9506 [2021-12-18 21:01:29,304 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 145 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:29,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 187 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 21:01:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-18 21:01:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2021-12-18 21:01:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.0102827763496145) internal successors, (393), 389 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 393 transitions. [2021-12-18 21:01:29,309 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 393 transitions. Word has length 374 [2021-12-18 21:01:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:29,309 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 393 transitions. [2021-12-18 21:01:29,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.086956521739131) internal successors, (280), 46 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 393 transitions. [2021-12-18 21:01:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-12-18 21:01:29,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:29,311 INFO L514 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1] [2021-12-18 21:01:29,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-18 21:01:29,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:29,519 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:29,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1649762294, now seen corresponding path program 9 times [2021-12-18 21:01:29,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:29,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597971066] [2021-12-18 21:01:29,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:29,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 7290 proven. 2602 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2021-12-18 21:01:29,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:29,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597971066] [2021-12-18 21:01:29,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597971066] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:29,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193937154] [2021-12-18 21:01:29,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 21:01:29,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:29,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:29,871 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:29,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-18 21:01:30,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-18 21:01:30,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:30,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 21:01:30,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:30,041 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:01:30,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:01:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 0 proven. 3163 refuted. 0 times theorem prover too weak. 7628 trivial. 0 not checked. [2021-12-18 21:01:31,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 0 proven. 3163 refuted. 0 times theorem prover too weak. 7628 trivial. 0 not checked. [2021-12-18 21:01:33,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193937154] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:33,458 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:33,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 47 [2021-12-18 21:01:33,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802780333] [2021-12-18 21:01:33,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:33,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-18 21:01:33,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-18 21:01:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=1744, Unknown=0, NotChecked=0, Total=2162 [2021-12-18 21:01:33,460 INFO L87 Difference]: Start difference. First operand 390 states and 393 transitions. Second operand has 47 states, 47 states have (on average 6.191489361702128) internal successors, (291), 47 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:36,638 INFO L93 Difference]: Finished difference Result 522 states and 535 transitions. [2021-12-18 21:01:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-18 21:01:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.191489361702128) internal successors, (291), 47 states have internal predecessors, (291), 0 states have call successors, (0), 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 384 [2021-12-18 21:01:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:36,640 INFO L225 Difference]: With dead ends: 522 [2021-12-18 21:01:36,640 INFO L226 Difference]: Without dead ends: 522 [2021-12-18 21:01:36,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5279 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4623, Invalid=15117, Unknown=0, NotChecked=0, Total=19740 [2021-12-18 21:01:36,642 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 721 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:36,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 183 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 21:01:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-12-18 21:01:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 450. [2021-12-18 21:01:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.0311804008908685) internal successors, (463), 449 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 463 transitions. [2021-12-18 21:01:36,648 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 463 transitions. Word has length 384 [2021-12-18 21:01:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:36,648 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 463 transitions. [2021-12-18 21:01:36,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.191489361702128) internal successors, (291), 47 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 463 transitions. [2021-12-18 21:01:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2021-12-18 21:01:36,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:36,650 INFO L514 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1] [2021-12-18 21:01:36,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:36,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:36,864 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:36,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2070971837, now seen corresponding path program 10 times [2021-12-18 21:01:36,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:36,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527545978] [2021-12-18 21:01:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:36,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 417 proven. 13839 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-12-18 21:01:37,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527545978] [2021-12-18 21:01:37,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527545978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:37,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468755186] [2021-12-18 21:01:37,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 21:01:37,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:37,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:37,177 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:37,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-18 21:01:37,704 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 21:01:37,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:37,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-18 21:01:37,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 1329 proven. 13224 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2021-12-18 21:01:38,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 1329 proven. 13224 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2021-12-18 21:01:40,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468755186] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:40,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:40,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35, 35] total 70 [2021-12-18 21:01:40,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414377158] [2021-12-18 21:01:40,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:40,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-12-18 21:01:40,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-12-18 21:01:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1339, Invalid=3491, Unknown=0, NotChecked=0, Total=4830 [2021-12-18 21:01:40,059 INFO L87 Difference]: Start difference. First operand 450 states and 463 transitions. Second operand has 70 states, 70 states have (on average 6.642857142857143) internal successors, (465), 70 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:46,310 INFO L93 Difference]: Finished difference Result 1468 states and 1557 transitions. [2021-12-18 21:01:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2021-12-18 21:01:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 6.642857142857143) internal successors, (465), 70 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 449 [2021-12-18 21:01:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:46,313 INFO L225 Difference]: With dead ends: 1468 [2021-12-18 21:01:46,313 INFO L226 Difference]: Without dead ends: 1468 [2021-12-18 21:01:46,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1192 GetRequests, 852 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62622 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=34492, Invalid=81448, Unknown=0, NotChecked=0, Total=115940 [2021-12-18 21:01:46,320 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 838 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:46,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [838 Valid, 162 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-18 21:01:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2021-12-18 21:01:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1457. [2021-12-18 21:01:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.0618131868131868) internal successors, (1546), 1456 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1546 transitions. [2021-12-18 21:01:46,333 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1546 transitions. Word has length 449 [2021-12-18 21:01:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:46,333 INFO L470 AbstractCegarLoop]: Abstraction has 1457 states and 1546 transitions. [2021-12-18 21:01:46,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 6.642857142857143) internal successors, (465), 70 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1546 transitions. [2021-12-18 21:01:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2021-12-18 21:01:46,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:46,341 INFO L514 BasicCegarLoop]: trace histogram [187, 187, 186, 186, 186, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1] [2021-12-18 21:01:46,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:46,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-18 21:01:46,555 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1138886418, now seen corresponding path program 11 times [2021-12-18 21:01:46,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:46,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038738220] [2021-12-18 21:01:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:46,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 91673 backedges. 34458 proven. 833 refuted. 0 times theorem prover too weak. 56382 trivial. 0 not checked. [2021-12-18 21:01:47,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038738220] [2021-12-18 21:01:47,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038738220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971199399] [2021-12-18 21:01:47,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-18 21:01:47,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:47,331 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:47,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-18 21:01:47,931 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2021-12-18 21:01:47,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:47,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-18 21:01:47,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 91673 backedges. 48319 proven. 3482 refuted. 0 times theorem prover too weak. 39872 trivial. 0 not checked. [2021-12-18 21:01:49,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:01:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 91673 backedges. 49198 proven. 2603 refuted. 0 times theorem prover too weak. 39872 trivial. 0 not checked. [2021-12-18 21:01:51,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971199399] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:01:51,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:01:51,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 65 [2021-12-18 21:01:51,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027235375] [2021-12-18 21:01:51,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:01:51,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-12-18 21:01:51,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:01:51,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-12-18 21:01:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=3430, Unknown=0, NotChecked=0, Total=4160 [2021-12-18 21:01:51,049 INFO L87 Difference]: Start difference. First operand 1457 states and 1546 transitions. Second operand has 65 states, 65 states have (on average 5.369230769230769) internal successors, (349), 65 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:01:53,584 INFO L93 Difference]: Finished difference Result 1457 states and 1534 transitions. [2021-12-18 21:01:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-12-18 21:01:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 5.369230769230769) internal successors, (349), 65 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 1076 [2021-12-18 21:01:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:01:53,588 INFO L225 Difference]: With dead ends: 1457 [2021-12-18 21:01:53,588 INFO L226 Difference]: Without dead ends: 1457 [2021-12-18 21:01:53,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2250 GetRequests, 2114 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3778, Invalid=15128, Unknown=0, NotChecked=0, Total=18906 [2021-12-18 21:01:53,591 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 217 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 3726 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:01:53,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 291 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3726 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-18 21:01:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2021-12-18 21:01:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2021-12-18 21:01:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.0535714285714286) internal successors, (1534), 1456 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1534 transitions. [2021-12-18 21:01:53,608 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1534 transitions. Word has length 1076 [2021-12-18 21:01:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:01:53,608 INFO L470 AbstractCegarLoop]: Abstraction has 1457 states and 1534 transitions. [2021-12-18 21:01:53,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 5.369230769230769) internal successors, (349), 65 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:01:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1534 transitions. [2021-12-18 21:01:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2021-12-18 21:01:53,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:01:53,616 INFO L514 BasicCegarLoop]: trace histogram [198, 198, 197, 197, 197, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1] [2021-12-18 21:01:53,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-12-18 21:01:53,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-18 21:01:53,831 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:01:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:01:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1593275497, now seen corresponding path program 12 times [2021-12-18 21:01:53,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:01:53,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386739375] [2021-12-18 21:01:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:01:53,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:01:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:01:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 102431 backedges. 38226 proven. 1001 refuted. 0 times theorem prover too weak. 63204 trivial. 0 not checked. [2021-12-18 21:01:54,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:01:54,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386739375] [2021-12-18 21:01:54,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386739375] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:01:54,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181081747] [2021-12-18 21:01:54,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-18 21:01:54,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:01:54,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:01:54,556 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:01:54,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-18 21:01:55,002 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2021-12-18 21:01:55,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:01:55,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-18 21:01:55,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:01:55,061 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:01:55,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:01:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 102431 backedges. 9527 proven. 20565 refuted. 0 times theorem prover too weak. 72339 trivial. 0 not checked. [2021-12-18 21:01:59,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:02:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 102431 backedges. 0 proven. 30092 refuted. 0 times theorem prover too weak. 72339 trivial. 0 not checked. [2021-12-18 21:02:04,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181081747] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:02:04,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:02:04,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 19] total 64 [2021-12-18 21:02:04,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751597296] [2021-12-18 21:02:04,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:02:04,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-18 21:02:04,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:02:04,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-18 21:02:04,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=3359, Unknown=0, NotChecked=0, Total=4032 [2021-12-18 21:02:04,600 INFO L87 Difference]: Start difference. First operand 1457 states and 1534 transitions. Second operand has 64 states, 64 states have (on average 4.890625) internal successors, (313), 64 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:02:12,741 INFO L93 Difference]: Finished difference Result 1665 states and 1746 transitions. [2021-12-18 21:02:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2021-12-18 21:02:12,742 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 4.890625) internal successors, (313), 64 states have internal predecessors, (313), 0 states have call successors, (0), 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 1131 [2021-12-18 21:02:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:02:12,744 INFO L225 Difference]: With dead ends: 1665 [2021-12-18 21:02:12,745 INFO L226 Difference]: Without dead ends: 1665 [2021-12-18 21:02:12,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2451 GetRequests, 2228 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15973 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=8366, Invalid=42034, Unknown=0, NotChecked=0, Total=50400 [2021-12-18 21:02:12,747 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 3195 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3195 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:02:12,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3195 Valid, 266 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 21:02:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2021-12-18 21:02:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1592. [2021-12-18 21:02:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1591 states have (on average 1.0521684475172848) internal successors, (1674), 1591 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1674 transitions. [2021-12-18 21:02:12,759 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1674 transitions. Word has length 1131 [2021-12-18 21:02:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:02:12,760 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 1674 transitions. [2021-12-18 21:02:12,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.890625) internal successors, (313), 64 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1674 transitions. [2021-12-18 21:02:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1309 [2021-12-18 21:02:12,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:02:12,770 INFO L514 BasicCegarLoop]: trace histogram [232, 232, 231, 231, 231, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1] [2021-12-18 21:02:12,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-12-18 21:02:12,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-18 21:02:12,987 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:02:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:02:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 738738834, now seen corresponding path program 13 times [2021-12-18 21:02:12,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:02:12,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767046272] [2021-12-18 21:02:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:02:12,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:02:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:02:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 139881 backedges. 64944 proven. 1184 refuted. 0 times theorem prover too weak. 73753 trivial. 0 not checked. [2021-12-18 21:02:13,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:02:13,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767046272] [2021-12-18 21:02:13,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767046272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:02:13,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526367410] [2021-12-18 21:02:13,763 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-18 21:02:13,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:02:13,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:02:13,764 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:02:13,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-18 21:02:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:02:14,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 3982 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-18 21:02:14,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:02:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 139881 backedges. 81118 proven. 5182 refuted. 0 times theorem prover too weak. 53581 trivial. 0 not checked. [2021-12-18 21:02:16,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:02:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 139881 backedges. 81118 proven. 5182 refuted. 0 times theorem prover too weak. 53581 trivial. 0 not checked. [2021-12-18 21:02:18,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526367410] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:02:18,019 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:02:18,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 27] total 66 [2021-12-18 21:02:18,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594310032] [2021-12-18 21:02:18,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:02:18,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-12-18 21:02:18,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:02:18,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-12-18 21:02:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=3586, Unknown=0, NotChecked=0, Total=4290 [2021-12-18 21:02:18,022 INFO L87 Difference]: Start difference. First operand 1592 states and 1674 transitions. Second operand has 66 states, 66 states have (on average 6.181818181818182) internal successors, (408), 66 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:02:22,334 INFO L93 Difference]: Finished difference Result 1592 states and 1663 transitions. [2021-12-18 21:02:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-12-18 21:02:22,334 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 6.181818181818182) internal successors, (408), 66 states have internal predecessors, (408), 0 states have call successors, (0), 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 1308 [2021-12-18 21:02:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:02:22,337 INFO L225 Difference]: With dead ends: 1592 [2021-12-18 21:02:22,337 INFO L226 Difference]: Without dead ends: 1592 [2021-12-18 21:02:22,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2747 GetRequests, 2581 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6787 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4910, Invalid=23146, Unknown=0, NotChecked=0, Total=28056 [2021-12-18 21:02:22,339 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 210 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 6827 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 6865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:02:22,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 392 Invalid, 6865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6827 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-18 21:02:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2021-12-18 21:02:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2021-12-18 21:02:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1591 states have (on average 1.0452545568824638) internal successors, (1663), 1591 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1663 transitions. [2021-12-18 21:02:22,352 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1663 transitions. Word has length 1308 [2021-12-18 21:02:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:02:22,353 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 1663 transitions. [2021-12-18 21:02:22,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 6.181818181818182) internal successors, (408), 66 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1663 transitions. [2021-12-18 21:02:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1354 [2021-12-18 21:02:22,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:02:22,364 INFO L514 BasicCegarLoop]: trace histogram [241, 241, 240, 240, 240, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1] [2021-12-18 21:02:22,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-12-18 21:02:22,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:02:22,578 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:02:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:02:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1786428189, now seen corresponding path program 14 times [2021-12-18 21:02:22,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:02:22,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209344749] [2021-12-18 21:02:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:02:22,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:02:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:02:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 150672 backedges. 69671 proven. 1382 refuted. 0 times theorem prover too weak. 79619 trivial. 0 not checked. [2021-12-18 21:02:23,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:02:23,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209344749] [2021-12-18 21:02:23,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209344749] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:02:23,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453812264] [2021-12-18 21:02:23,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:02:23,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:02:23,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:02:23,416 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:02:23,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-18 21:02:24,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:02:24,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:02:24,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 4108 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-18 21:02:24,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:02:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 150672 backedges. 93912 proven. 6511 refuted. 0 times theorem prover too weak. 50249 trivial. 0 not checked. [2021-12-18 21:02:26,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:02:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 150672 backedges. 93912 proven. 6511 refuted. 0 times theorem prover too weak. 50249 trivial. 0 not checked. [2021-12-18 21:02:27,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453812264] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:02:27,892 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:02:27,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 29] total 71 [2021-12-18 21:02:27,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911229615] [2021-12-18 21:02:27,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:02:27,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2021-12-18 21:02:27,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:02:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-12-18 21:02:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=4163, Unknown=0, NotChecked=0, Total=4970 [2021-12-18 21:02:27,895 INFO L87 Difference]: Start difference. First operand 1592 states and 1663 transitions. Second operand has 71 states, 71 states have (on average 6.197183098591549) internal successors, (440), 71 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:02:32,863 INFO L93 Difference]: Finished difference Result 1674 states and 1735 transitions. [2021-12-18 21:02:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-12-18 21:02:32,864 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 6.197183098591549) internal successors, (440), 71 states have internal predecessors, (440), 0 states have call successors, (0), 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 1353 [2021-12-18 21:02:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:02:32,867 INFO L225 Difference]: With dead ends: 1674 [2021-12-18 21:02:32,867 INFO L226 Difference]: Without dead ends: 1674 [2021-12-18 21:02:32,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2854 GetRequests, 2668 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8609 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6114, Invalid=29042, Unknown=0, NotChecked=0, Total=35156 [2021-12-18 21:02:32,870 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 221 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 7140 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 7182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 7140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:02:32,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 333 Invalid, 7182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 7140 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-18 21:02:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-12-18 21:02:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1664. [2021-12-18 21:02:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1663 states have (on average 1.0372820204449789) internal successors, (1725), 1663 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 1725 transitions. [2021-12-18 21:02:32,883 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 1725 transitions. Word has length 1353 [2021-12-18 21:02:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:02:32,884 INFO L470 AbstractCegarLoop]: Abstraction has 1664 states and 1725 transitions. [2021-12-18 21:02:32,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 6.197183098591549) internal successors, (440), 71 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1725 transitions. [2021-12-18 21:02:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1394 [2021-12-18 21:02:32,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:02:32,909 INFO L514 BasicCegarLoop]: trace histogram [249, 249, 248, 248, 248, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1] [2021-12-18 21:02:32,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-12-18 21:02:33,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-18 21:02:33,131 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:02:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:02:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash -524826813, now seen corresponding path program 15 times [2021-12-18 21:02:33,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:02:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381040960] [2021-12-18 21:02:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:02:33,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:02:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:02:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 160604 backedges. 74167 proven. 1595 refuted. 0 times theorem prover too weak. 84842 trivial. 0 not checked. [2021-12-18 21:02:34,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:02:34,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381040960] [2021-12-18 21:02:34,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381040960] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:02:34,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571125163] [2021-12-18 21:02:34,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 21:02:34,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:02:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:02:34,208 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:02:34,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-18 21:02:34,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-12-18 21:02:34,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:02:34,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-18 21:02:34,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:02:34,953 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:02:34,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:02:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 160604 backedges. 0 proven. 27242 refuted. 0 times theorem prover too weak. 133362 trivial. 0 not checked. [2021-12-18 21:02:40,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:02:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 160604 backedges. 0 proven. 27242 refuted. 0 times theorem prover too weak. 133362 trivial. 0 not checked. [2021-12-18 21:02:46,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571125163] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:02:46,355 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:02:46,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 26, 26] total 84 [2021-12-18 21:02:46,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656999907] [2021-12-18 21:02:46,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:02:46,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2021-12-18 21:02:46,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:02:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-12-18 21:02:46,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1312, Invalid=5660, Unknown=0, NotChecked=0, Total=6972 [2021-12-18 21:02:46,358 INFO L87 Difference]: Start difference. First operand 1664 states and 1725 transitions. Second operand has 84 states, 84 states have (on average 5.119047619047619) internal successors, (430), 84 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:02:51,284 INFO L93 Difference]: Finished difference Result 2063 states and 2130 transitions. [2021-12-18 21:02:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2021-12-18 21:02:51,285 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 5.119047619047619) internal successors, (430), 84 states have internal predecessors, (430), 0 states have call successors, (0), 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 1393 [2021-12-18 21:02:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:02:51,289 INFO L225 Difference]: With dead ends: 2063 [2021-12-18 21:02:51,289 INFO L226 Difference]: Without dead ends: 2063 [2021-12-18 21:02:51,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2932 GetRequests, 2737 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10655 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7662, Invalid=30950, Unknown=0, NotChecked=0, Total=38612 [2021-12-18 21:02:51,292 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 2293 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 21:02:51,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2293 Valid, 358 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-18 21:02:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2021-12-18 21:02:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1783. [2021-12-18 21:02:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.0336700336700337) internal successors, (1842), 1782 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1842 transitions. [2021-12-18 21:02:51,306 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1842 transitions. Word has length 1393 [2021-12-18 21:02:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:02:51,306 INFO L470 AbstractCegarLoop]: Abstraction has 1783 states and 1842 transitions. [2021-12-18 21:02:51,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 5.119047619047619) internal successors, (430), 84 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:02:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1842 transitions. [2021-12-18 21:02:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1479 [2021-12-18 21:02:51,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:02:51,320 INFO L514 BasicCegarLoop]: trace histogram [266, 266, 265, 265, 265, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1] [2021-12-18 21:02:51,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-12-18 21:02:51,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-18 21:02:51,541 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:02:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:02:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -950517878, now seen corresponding path program 16 times [2021-12-18 21:02:51,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:02:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805462938] [2021-12-18 21:02:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:02:51,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:02:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:02:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 182772 backedges. 89052 proven. 1823 refuted. 0 times theorem prover too weak. 91897 trivial. 0 not checked. [2021-12-18 21:02:52,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:02:52,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805462938] [2021-12-18 21:02:52,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805462938] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:02:52,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731884573] [2021-12-18 21:02:52,500 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 21:02:52,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:02:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:02:52,501 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:02:52,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-18 21:03:04,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 21:03:04,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:03:04,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 4458 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-18 21:03:04,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:03:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 182772 backedges. 153634 proven. 15588 refuted. 0 times theorem prover too weak. 13550 trivial. 0 not checked. [2021-12-18 21:03:06,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:03:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 182772 backedges. 153634 proven. 15588 refuted. 0 times theorem prover too weak. 13550 trivial. 0 not checked. [2021-12-18 21:03:09,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731884573] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:03:09,225 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:03:09,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38, 38] total 91 [2021-12-18 21:03:09,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319368209] [2021-12-18 21:03:09,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:03:09,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2021-12-18 21:03:09,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:03:09,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-12-18 21:03:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=6882, Unknown=0, NotChecked=0, Total=8190 [2021-12-18 21:03:09,248 INFO L87 Difference]: Start difference. First operand 1783 states and 1842 transitions. Second operand has 91 states, 91 states have (on average 6.868131868131868) internal successors, (625), 91 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:03:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:03:22,137 INFO L93 Difference]: Finished difference Result 2385 states and 2423 transitions. [2021-12-18 21:03:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 266 states. [2021-12-18 21:03:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 6.868131868131868) internal successors, (625), 91 states have internal predecessors, (625), 0 states have call successors, (0), 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 1478 [2021-12-18 21:03:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:03:22,142 INFO L225 Difference]: With dead ends: 2385 [2021-12-18 21:03:22,142 INFO L226 Difference]: Without dead ends: 2385 [2021-12-18 21:03:22,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3234 GetRequests, 2902 SyntacticMatches, 0 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28799 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=20878, Invalid=90344, Unknown=0, NotChecked=0, Total=111222 [2021-12-18 21:03:22,147 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 268 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 16294 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 16355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 16294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-18 21:03:22,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 614 Invalid, 16355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 16294 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-12-18 21:03:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2021-12-18 21:03:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2375. [2021-12-18 21:03:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 1.0164279696714407) internal successors, (2413), 2374 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:03:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2413 transitions. [2021-12-18 21:03:22,164 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2413 transitions. Word has length 1478 [2021-12-18 21:03:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:03:22,164 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 2413 transitions. [2021-12-18 21:03:22,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 6.868131868131868) internal successors, (625), 91 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:03:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2413 transitions. [2021-12-18 21:03:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2021-12-18 21:03:22,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:03:22,179 INFO L514 BasicCegarLoop]: trace histogram [281, 281, 280, 280, 280, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1] [2021-12-18 21:03:22,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-12-18 21:03:22,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-18 21:03:22,395 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:03:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:03:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2011725613, now seen corresponding path program 17 times [2021-12-18 21:03:22,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:03:22,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067075551] [2021-12-18 21:03:22,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:03:22,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:03:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:03:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 203532 backedges. 111350 proven. 2324 refuted. 0 times theorem prover too weak. 89858 trivial. 0 not checked. [2021-12-18 21:03:23,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:03:23,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067075551] [2021-12-18 21:03:23,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067075551] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:03:23,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783549379] [2021-12-18 21:03:23,486 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-18 21:03:23,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:03:23,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:03:23,487 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:03:23,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-12-18 21:03:28,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2021-12-18 21:03:28,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:03:28,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 4002 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 21:03:28,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:03:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 203532 backedges. 151603 proven. 16208 refuted. 0 times theorem prover too weak. 35721 trivial. 0 not checked. [2021-12-18 21:03:31,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:03:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 203532 backedges. 154575 proven. 13236 refuted. 0 times theorem prover too weak. 35721 trivial. 0 not checked. [2021-12-18 21:03:33,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783549379] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:03:33,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:03:33,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 100 [2021-12-18 21:03:33,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275463857] [2021-12-18 21:03:33,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:03:33,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2021-12-18 21:03:33,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:03:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2021-12-18 21:03:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1619, Invalid=8281, Unknown=0, NotChecked=0, Total=9900 [2021-12-18 21:03:33,870 INFO L87 Difference]: Start difference. First operand 2375 states and 2413 transitions. Second operand has 100 states, 100 states have (on average 5.73) internal successors, (573), 100 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:03:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:03:43,461 INFO L93 Difference]: Finished difference Result 2564 states and 2596 transitions. [2021-12-18 21:03:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2021-12-18 21:03:43,462 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 5.73) internal successors, (573), 100 states have internal predecessors, (573), 0 states have call successors, (0), 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 1553 [2021-12-18 21:03:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:03:43,467 INFO L225 Difference]: With dead ends: 2564 [2021-12-18 21:03:43,467 INFO L226 Difference]: Without dead ends: 2564 [2021-12-18 21:03:43,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3337 GetRequests, 3047 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21645 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15727, Invalid=69245, Unknown=0, NotChecked=0, Total=84972 [2021-12-18 21:03:43,472 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 327 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 11953 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 12019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 11953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:03:43,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 532 Invalid, 12019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 11953 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-18 21:03:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2021-12-18 21:03:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2554. [2021-12-18 21:03:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 1.0129259694477086) internal successors, (2586), 2553 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:03:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 2586 transitions. [2021-12-18 21:03:43,504 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 2586 transitions. Word has length 1553 [2021-12-18 21:03:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:03:43,504 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 2586 transitions. [2021-12-18 21:03:43,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 5.73) internal successors, (573), 100 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:03:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 2586 transitions. [2021-12-18 21:03:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1569 [2021-12-18 21:03:43,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:03:43,520 INFO L514 BasicCegarLoop]: trace histogram [284, 284, 283, 283, 283, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1] [2021-12-18 21:03:43,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-12-18 21:03:43,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-18 21:03:43,747 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:03:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:03:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -595969838, now seen corresponding path program 18 times [2021-12-18 21:03:43,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:03:43,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100651866] [2021-12-18 21:03:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:03:43,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:03:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:03:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 207819 backedges. 114502 proven. 2597 refuted. 0 times theorem prover too weak. 90720 trivial. 0 not checked. [2021-12-18 21:03:45,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:03:45,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100651866] [2021-12-18 21:03:45,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100651866] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:03:45,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187378314] [2021-12-18 21:03:45,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-18 21:03:45,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:03:45,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:03:45,163 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:03:45,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-18 21:03:49,476 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2021-12-18 21:03:49,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:03:49,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 3359 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-18 21:03:49,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:03:49,570 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:03:49,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 21:03:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 207819 backedges. 28088 proven. 43074 refuted. 0 times theorem prover too weak. 136657 trivial. 0 not checked. [2021-12-18 21:03:56,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:04:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 207819 backedges. 0 proven. 71162 refuted. 0 times theorem prover too weak. 136657 trivial. 0 not checked. [2021-12-18 21:04:04,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187378314] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:04:04,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:04:04,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 32, 32] total 104 [2021-12-18 21:04:04,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307036032] [2021-12-18 21:04:04,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:04:04,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-12-18 21:04:04,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:04:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-12-18 21:04:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=8790, Unknown=0, NotChecked=0, Total=10712 [2021-12-18 21:04:04,241 INFO L87 Difference]: Start difference. First operand 2554 states and 2586 transitions. Second operand has 104 states, 104 states have (on average 4.9423076923076925) internal successors, (514), 104 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:04:18,313 INFO L93 Difference]: Finished difference Result 3232 states and 3297 transitions. [2021-12-18 21:04:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2021-12-18 21:04:18,314 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 4.9423076923076925) internal successors, (514), 104 states have internal predecessors, (514), 0 states have call successors, (0), 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 1568 [2021-12-18 21:04:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:04:18,320 INFO L225 Difference]: With dead ends: 3232 [2021-12-18 21:04:18,320 INFO L226 Difference]: Without dead ends: 3232 [2021-12-18 21:04:18,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3419 GetRequests, 3075 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37459 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=19916, Invalid=99454, Unknown=0, NotChecked=0, Total=119370 [2021-12-18 21:04:18,327 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 4985 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 3960 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4985 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 4983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 3960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 21:04:18,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4985 Valid, 542 Invalid, 4983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1023 Valid, 3960 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-18 21:04:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2021-12-18 21:04:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2955. [2021-12-18 21:04:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2954 states have (on average 1.0159106296547056) internal successors, (3001), 2954 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3001 transitions. [2021-12-18 21:04:18,347 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3001 transitions. Word has length 1568 [2021-12-18 21:04:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:04:18,347 INFO L470 AbstractCegarLoop]: Abstraction has 2955 states and 3001 transitions. [2021-12-18 21:04:18,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 4.9423076923076925) internal successors, (514), 104 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3001 transitions. [2021-12-18 21:04:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1883 [2021-12-18 21:04:18,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:04:18,394 INFO L514 BasicCegarLoop]: trace histogram [344, 344, 343, 343, 343, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1] [2021-12-18 21:04:18,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-12-18 21:04:18,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-12-18 21:04:18,607 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:04:18,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:04:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1136406914, now seen corresponding path program 19 times [2021-12-18 21:04:18,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:04:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490707706] [2021-12-18 21:04:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:04:18,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:04:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:04:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 304000 backedges. 231234 proven. 20637 refuted. 0 times theorem prover too weak. 52129 trivial. 0 not checked. [2021-12-18 21:04:20,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:04:20,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490707706] [2021-12-18 21:04:20,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490707706] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:04:20,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386227246] [2021-12-18 21:04:20,139 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-18 21:04:20,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:04:20,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:04:20,140 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:04:20,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-18 21:04:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:04:21,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 5616 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 21:04:21,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:04:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 304000 backedges. 232493 proven. 19378 refuted. 0 times theorem prover too weak. 52129 trivial. 0 not checked. [2021-12-18 21:04:23,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:04:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 304000 backedges. 232493 proven. 19378 refuted. 0 times theorem prover too weak. 52129 trivial. 0 not checked. [2021-12-18 21:04:26,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386227246] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:04:26,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:04:26,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2021-12-18 21:04:26,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812970823] [2021-12-18 21:04:26,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:04:26,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2021-12-18 21:04:26,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:04:26,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-12-18 21:04:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1362, Invalid=5280, Unknown=0, NotChecked=0, Total=6642 [2021-12-18 21:04:26,639 INFO L87 Difference]: Start difference. First operand 2955 states and 3001 transitions. Second operand has 82 states, 82 states have (on average 6.524390243902439) internal successors, (535), 82 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:04:33,199 INFO L93 Difference]: Finished difference Result 2955 states and 3000 transitions. [2021-12-18 21:04:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2021-12-18 21:04:33,199 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 6.524390243902439) internal successors, (535), 82 states have internal predecessors, (535), 0 states have call successors, (0), 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 1882 [2021-12-18 21:04:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:04:33,205 INFO L225 Difference]: With dead ends: 2955 [2021-12-18 21:04:33,205 INFO L226 Difference]: Without dead ends: 2955 [2021-12-18 21:04:33,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4020 GetRequests, 3723 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27163 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=23982, Invalid=65120, Unknown=0, NotChecked=0, Total=89102 [2021-12-18 21:04:33,211 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 198 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3257 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:04:33,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 489 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3257 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 21:04:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2021-12-18 21:04:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2021-12-18 21:04:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2954 states have (on average 1.015572105619499) internal successors, (3000), 2954 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3000 transitions. [2021-12-18 21:04:33,230 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3000 transitions. Word has length 1882 [2021-12-18 21:04:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:04:33,231 INFO L470 AbstractCegarLoop]: Abstraction has 2955 states and 3000 transitions. [2021-12-18 21:04:33,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 6.524390243902439) internal successors, (535), 82 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3000 transitions. [2021-12-18 21:04:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1888 [2021-12-18 21:04:33,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:04:33,250 INFO L514 BasicCegarLoop]: trace histogram [345, 345, 344, 344, 344, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1] [2021-12-18 21:04:33,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-12-18 21:04:33,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:04:33,463 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:04:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:04:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash -87602005, now seen corresponding path program 20 times [2021-12-18 21:04:33,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:04:33,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582351553] [2021-12-18 21:04:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:04:33,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:04:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:04:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 305741 backedges. 119020 proven. 158286 refuted. 0 times theorem prover too weak. 28435 trivial. 0 not checked. [2021-12-18 21:04:34,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:04:34,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582351553] [2021-12-18 21:04:34,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582351553] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:04:34,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740773368] [2021-12-18 21:04:34,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:04:34,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:04:34,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:04:34,804 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:04:34,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-18 21:04:35,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:04:35,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:04:35,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 5630 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-18 21:04:35,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:04:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 305741 backedges. 120715 proven. 155685 refuted. 0 times theorem prover too weak. 29341 trivial. 0 not checked. [2021-12-18 21:04:38,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:04:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 305741 backedges. 120715 proven. 155685 refuted. 0 times theorem prover too weak. 29341 trivial. 0 not checked. [2021-12-18 21:04:41,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740773368] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:04:41,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:04:41,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 94 [2021-12-18 21:04:41,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887641446] [2021-12-18 21:04:41,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:04:41,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2021-12-18 21:04:41,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:04:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-12-18 21:04:41,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1728, Invalid=7014, Unknown=0, NotChecked=0, Total=8742 [2021-12-18 21:04:41,516 INFO L87 Difference]: Start difference. First operand 2955 states and 3000 transitions. Second operand has 94 states, 94 states have (on average 6.468085106382978) internal successors, (608), 94 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:04:49,987 INFO L93 Difference]: Finished difference Result 2017 states and 2052 transitions. [2021-12-18 21:04:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 300 states. [2021-12-18 21:04:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 6.468085106382978) internal successors, (608), 94 states have internal predecessors, (608), 0 states have call successors, (0), 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 1887 [2021-12-18 21:04:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:04:49,992 INFO L225 Difference]: With dead ends: 2017 [2021-12-18 21:04:49,992 INFO L226 Difference]: Without dead ends: 2017 [2021-12-18 21:04:49,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4115 GetRequests, 3727 SyntacticMatches, 1 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61975 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=31328, Invalid=119604, Unknown=0, NotChecked=0, Total=150932 [2021-12-18 21:04:49,998 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 1219 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 4697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 21:04:49,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 323 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 4697 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-18 21:04:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2021-12-18 21:04:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2005. [2021-12-18 21:04:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 2004 states have (on average 1.0179640718562875) internal successors, (2040), 2004 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2040 transitions. [2021-12-18 21:04:50,012 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2040 transitions. Word has length 1887 [2021-12-18 21:04:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:04:50,013 INFO L470 AbstractCegarLoop]: Abstraction has 2005 states and 2040 transitions. [2021-12-18 21:04:50,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 6.468085106382978) internal successors, (608), 94 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:04:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2040 transitions. [2021-12-18 21:04:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2000 [2021-12-18 21:04:50,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:04:50,042 INFO L514 BasicCegarLoop]: trace histogram [366, 366, 365, 365, 365, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1] [2021-12-18 21:04:50,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-18 21:04:50,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-12-18 21:04:50,259 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:04:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:04:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash 829353423, now seen corresponding path program 21 times [2021-12-18 21:04:50,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:04:50,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962226852] [2021-12-18 21:04:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:04:50,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:04:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:04:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 343985 backedges. 275712 proven. 27412 refuted. 0 times theorem prover too weak. 40861 trivial. 0 not checked. [2021-12-18 21:04:51,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:04:51,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962226852] [2021-12-18 21:04:51,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962226852] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:04:51,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976993728] [2021-12-18 21:04:51,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 21:04:51,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:04:51,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:04:51,691 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:04:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-12-18 21:04:56,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2021-12-18 21:04:56,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:04:56,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 3078 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-18 21:04:56,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:05:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 343985 backedges. 162807 proven. 37872 refuted. 0 times theorem prover too weak. 143306 trivial. 0 not checked. [2021-12-18 21:05:00,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:05:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 343985 backedges. 161890 proven. 38789 refuted. 0 times theorem prover too weak. 143306 trivial. 0 not checked. [2021-12-18 21:05:04,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976993728] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:05:04,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:05:04,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 56, 56] total 147 [2021-12-18 21:05:04,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357155220] [2021-12-18 21:05:04,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:05:04,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2021-12-18 21:05:04,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:05:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2021-12-18 21:05:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=18654, Unknown=0, NotChecked=0, Total=21462 [2021-12-18 21:05:04,653 INFO L87 Difference]: Start difference. First operand 2005 states and 2040 transitions. Second operand has 147 states, 147 states have (on average 6.0272108843537415) internal successors, (886), 147 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:05:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:05:25,504 INFO L93 Difference]: Finished difference Result 2428 states and 2464 transitions. [2021-12-18 21:05:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2021-12-18 21:05:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 147 states, 147 states have (on average 6.0272108843537415) internal successors, (886), 147 states have internal predecessors, (886), 0 states have call successors, (0), 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 1999 [2021-12-18 21:05:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:05:25,509 INFO L225 Difference]: With dead ends: 2428 [2021-12-18 21:05:25,510 INFO L226 Difference]: Without dead ends: 2428 [2021-12-18 21:05:25,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4467 GetRequests, 3897 SyntacticMatches, 0 SemanticMatches, 570 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107195 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=41332, Invalid=285280, Unknown=0, NotChecked=0, Total=326612 [2021-12-18 21:05:25,532 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 4021 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 21702 mSolverCounterSat, 857 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4021 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 22559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 857 IncrementalHoareTripleChecker+Valid, 21702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:05:25,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4021 Valid, 715 Invalid, 22559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [857 Valid, 21702 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2021-12-18 21:05:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2021-12-18 21:05:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2386. [2021-12-18 21:05:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2385 states have (on average 1.0155136268343816) internal successors, (2422), 2385 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:05:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2422 transitions. [2021-12-18 21:05:25,546 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2422 transitions. Word has length 1999 [2021-12-18 21:05:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:05:25,547 INFO L470 AbstractCegarLoop]: Abstraction has 2386 states and 2422 transitions. [2021-12-18 21:05:25,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 147 states have (on average 6.0272108843537415) internal successors, (886), 147 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:05:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2422 transitions. [2021-12-18 21:05:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2021-12-18 21:05:25,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:05:25,572 INFO L514 BasicCegarLoop]: trace histogram [411, 411, 410, 410, 410, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1] [2021-12-18 21:05:25,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-12-18 21:05:25,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:05:25,799 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:05:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:05:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1177943594, now seen corresponding path program 22 times [2021-12-18 21:05:25,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:05:25,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980666665] [2021-12-18 21:05:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:05:25,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:05:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:05:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 433442 backedges. 231759 proven. 3839 refuted. 0 times theorem prover too weak. 197844 trivial. 0 not checked. [2021-12-18 21:05:27,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:05:27,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980666665] [2021-12-18 21:05:27,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980666665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:05:27,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375346743] [2021-12-18 21:05:27,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 21:05:27,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:05:27,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:05:27,442 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:05:27,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-12-18 21:05:42,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 21:05:42,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:05:42,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 6653 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-18 21:05:42,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:05:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 433442 backedges. 3332 proven. 413087 refuted. 0 times theorem prover too weak. 17023 trivial. 0 not checked. [2021-12-18 21:05:47,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:05:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 433442 backedges. 3332 proven. 413087 refuted. 0 times theorem prover too weak. 17023 trivial. 0 not checked. [2021-12-18 21:05:51,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375346743] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:05:51,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:05:51,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 62, 62] total 147 [2021-12-18 21:05:51,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608326422] [2021-12-18 21:05:51,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:05:51,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2021-12-18 21:05:51,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:05:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2021-12-18 21:05:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2964, Invalid=18498, Unknown=0, NotChecked=0, Total=21462 [2021-12-18 21:05:51,675 INFO L87 Difference]: Start difference. First operand 2386 states and 2422 transitions. Second operand has 147 states, 147 states have (on average 6.408163265306122) internal successors, (942), 147 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:06:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:06:30,301 INFO L93 Difference]: Finished difference Result 5563 states and 5715 transitions. [2021-12-18 21:06:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 944 states. [2021-12-18 21:06:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 147 states, 147 states have (on average 6.408163265306122) internal successors, (942), 147 states have internal predecessors, (942), 0 states have call successors, (0), 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 2238 [2021-12-18 21:06:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:06:30,311 INFO L225 Difference]: With dead ends: 5563 [2021-12-18 21:06:30,311 INFO L226 Difference]: Without dead ends: 5563 [2021-12-18 21:06:30,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5465 GetRequests, 4379 SyntacticMatches, 1 SemanticMatches, 1085 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505893 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=100338, Invalid=1080144, Unknown=0, NotChecked=0, Total=1180482 [2021-12-18 21:06:30,362 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 6088 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 11886 mSolverCounterSat, 1806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6088 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 13692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1806 IncrementalHoareTripleChecker+Valid, 11886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-12-18 21:06:30,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6088 Valid, 905 Invalid, 13692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1806 Valid, 11886 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2021-12-18 21:06:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states. [2021-12-18 21:06:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 3946. [2021-12-18 21:06:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3945 states have (on average 1.0248415716096324) internal successors, (4043), 3945 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:06:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 4043 transitions. [2021-12-18 21:06:30,386 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 4043 transitions. Word has length 2238 [2021-12-18 21:06:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:06:30,387 INFO L470 AbstractCegarLoop]: Abstraction has 3946 states and 4043 transitions. [2021-12-18 21:06:30,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 147 states have (on average 6.408163265306122) internal successors, (942), 147 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:06:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 4043 transitions. [2021-12-18 21:06:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2859 [2021-12-18 21:06:30,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:06:30,426 INFO L514 BasicCegarLoop]: trace histogram [528, 528, 527, 527, 527, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1] [2021-12-18 21:06:30,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2021-12-18 21:06:30,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-12-18 21:06:30,627 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:06:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:06:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash -187793902, now seen corresponding path program 23 times [2021-12-18 21:06:30,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:06:30,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815144279] [2021-12-18 21:06:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:06:30,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:06:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:06:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 714240 backedges. 329474 proven. 4187 refuted. 0 times theorem prover too weak. 380579 trivial. 0 not checked. [2021-12-18 21:06:33,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:06:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815144279] [2021-12-18 21:06:33,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815144279] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:06:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086662863] [2021-12-18 21:06:33,198 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-18 21:06:33,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:06:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:06:33,199 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:06:33,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-12-18 21:06:54,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2021-12-18 21:06:54,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:06:54,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 5511 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-18 21:06:54,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:06:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 714240 backedges. 531428 proven. 38754 refuted. 0 times theorem prover too weak. 144058 trivial. 0 not checked. [2021-12-18 21:06:58,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:07:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 714240 backedges. 538177 proven. 32005 refuted. 0 times theorem prover too weak. 144058 trivial. 0 not checked. [2021-12-18 21:07:03,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086662863] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:07:03,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:07:03,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 131 [2021-12-18 21:07:03,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893261363] [2021-12-18 21:07:03,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:07:03,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2021-12-18 21:07:03,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:07:03,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2021-12-18 21:07:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=14326, Unknown=0, NotChecked=0, Total=17030 [2021-12-18 21:07:03,392 INFO L87 Difference]: Start difference. First operand 3946 states and 4043 transitions. Second operand has 131 states, 131 states have (on average 5.824427480916031) internal successors, (763), 131 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:07:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:07:24,888 INFO L93 Difference]: Finished difference Result 3946 states and 4027 transitions. [2021-12-18 21:07:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 338 states. [2021-12-18 21:07:24,889 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 5.824427480916031) internal successors, (763), 131 states have internal predecessors, (763), 0 states have call successors, (0), 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 2858 [2021-12-18 21:07:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:07:24,894 INFO L225 Difference]: With dead ends: 3946 [2021-12-18 21:07:24,895 INFO L226 Difference]: Without dead ends: 3946 [2021-12-18 21:07:24,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6095 GetRequests, 5638 SyntacticMatches, 0 SemanticMatches, 457 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55381 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=37792, Invalid=172430, Unknown=0, NotChecked=0, Total=210222 [2021-12-18 21:07:24,904 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 392 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 23543 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 23619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 23543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:07:24,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 567 Invalid, 23619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 23543 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2021-12-18 21:07:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-12-18 21:07:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3946. [2021-12-18 21:07:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3945 states have (on average 1.020785804816223) internal successors, (4027), 3945 states have internal predecessors, (4027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:07:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 4027 transitions. [2021-12-18 21:07:24,953 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 4027 transitions. Word has length 2858 [2021-12-18 21:07:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:07:24,954 INFO L470 AbstractCegarLoop]: Abstraction has 3946 states and 4027 transitions. [2021-12-18 21:07:24,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 5.824427480916031) internal successors, (763), 131 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:07:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 4027 transitions. [2021-12-18 21:07:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2889 [2021-12-18 21:07:24,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:07:24,994 INFO L514 BasicCegarLoop]: trace histogram [534, 534, 533, 533, 533, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1] [2021-12-18 21:07:25,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-12-18 21:07:25,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-18 21:07:25,195 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:07:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:07:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash 180639642, now seen corresponding path program 24 times [2021-12-18 21:07:25,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:07:25,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718402186] [2021-12-18 21:07:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:07:25,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:07:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:07:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 730329 backedges. 305345 proven. 10892 refuted. 0 times theorem prover too weak. 414092 trivial. 0 not checked. [2021-12-18 21:07:28,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:07:28,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718402186] [2021-12-18 21:07:28,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718402186] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:07:28,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150707780] [2021-12-18 21:07:28,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-18 21:07:28,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:07:28,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:07:28,226 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:07:28,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-12-18 21:08:01,942 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 77 check-sat command(s) [2021-12-18 21:08:01,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:08:02,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 5401 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-18 21:08:02,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:08:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 730329 backedges. 218000 proven. 102271 refuted. 0 times theorem prover too weak. 410058 trivial. 0 not checked. [2021-12-18 21:08:09,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:08:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 730329 backedges. 205508 proven. 14832 refuted. 0 times theorem prover too weak. 509989 trivial. 0 not checked. [2021-12-18 21:08:15,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150707780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:08:15,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:08:15,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 72, 64] total 188 [2021-12-18 21:08:15,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35823693] [2021-12-18 21:08:15,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:08:15,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 188 states [2021-12-18 21:08:15,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:08:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2021-12-18 21:08:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=30762, Unknown=0, NotChecked=0, Total=35156 [2021-12-18 21:08:15,296 INFO L87 Difference]: Start difference. First operand 3946 states and 4027 transitions. Second operand has 188 states, 188 states have (on average 5.0212765957446805) internal successors, (944), 188 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:08:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:08:38,642 INFO L93 Difference]: Finished difference Result 3693 states and 3744 transitions. [2021-12-18 21:08:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 388 states. [2021-12-18 21:08:38,642 INFO L78 Accepts]: Start accepts. Automaton has has 188 states, 188 states have (on average 5.0212765957446805) internal successors, (944), 188 states have internal predecessors, (944), 0 states have call successors, (0), 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 2888 [2021-12-18 21:08:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:08:38,646 INFO L225 Difference]: With dead ends: 3693 [2021-12-18 21:08:38,646 INFO L226 Difference]: Without dead ends: 3693 [2021-12-18 21:08:38,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6216 GetRequests, 5636 SyntacticMatches, 9 SemanticMatches, 571 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105696 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=42290, Invalid=285466, Unknown=0, NotChecked=0, Total=327756 [2021-12-18 21:08:38,661 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 8082 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 18571 mSolverCounterSat, 1747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8082 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 20318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1747 IncrementalHoareTripleChecker+Valid, 18571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-12-18 21:08:38,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8082 Valid, 678 Invalid, 20318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1747 Valid, 18571 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2021-12-18 21:08:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2021-12-18 21:08:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 3186. [2021-12-18 21:08:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.011302982731554) internal successors, (3221), 3185 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:08:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3221 transitions. [2021-12-18 21:08:38,678 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3221 transitions. Word has length 2888 [2021-12-18 21:08:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:08:38,679 INFO L470 AbstractCegarLoop]: Abstraction has 3186 states and 3221 transitions. [2021-12-18 21:08:38,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 188 states, 188 states have (on average 5.0212765957446805) internal successors, (944), 188 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:08:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3221 transitions. [2021-12-18 21:08:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2969 [2021-12-18 21:08:38,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:08:38,721 INFO L514 BasicCegarLoop]: trace histogram [550, 550, 549, 549, 549, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1] [2021-12-18 21:08:38,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2021-12-18 21:08:38,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-12-18 21:08:38,921 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:08:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:08:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash -213931310, now seen corresponding path program 25 times [2021-12-18 21:08:38,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:08:38,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977504743] [2021-12-18 21:08:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:08:38,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:08:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:08:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 774113 backedges. 329628 proven. 5321 refuted. 0 times theorem prover too weak. 439164 trivial. 0 not checked. [2021-12-18 21:08:41,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:08:41,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977504743] [2021-12-18 21:08:41,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977504743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:08:41,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970080735] [2021-12-18 21:08:41,347 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-18 21:08:41,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:08:41,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:08:41,348 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:08:41,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-12-18 21:08:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:08:42,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 8764 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-18 21:08:42,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:08:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 774113 backedges. 635083 proven. 48176 refuted. 0 times theorem prover too weak. 90854 trivial. 0 not checked. [2021-12-18 21:08:47,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:08:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 774113 backedges. 635083 proven. 48176 refuted. 0 times theorem prover too weak. 90854 trivial. 0 not checked. [2021-12-18 21:08:52,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970080735] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:08:52,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:08:52,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 55, 55] total 136 [2021-12-18 21:08:52,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395190462] [2021-12-18 21:08:52,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:08:52,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2021-12-18 21:08:52,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:08:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2021-12-18 21:08:52,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2783, Invalid=15577, Unknown=0, NotChecked=0, Total=18360 [2021-12-18 21:08:52,800 INFO L87 Difference]: Start difference. First operand 3186 states and 3221 transitions. Second operand has 136 states, 136 states have (on average 6.294117647058823) internal successors, (856), 136 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:09:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:09:24,653 INFO L93 Difference]: Finished difference Result 3186 states and 3213 transitions. [2021-12-18 21:09:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 432 states. [2021-12-18 21:09:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 6.294117647058823) internal successors, (856), 136 states have internal predecessors, (856), 0 states have call successors, (0), 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 2968 [2021-12-18 21:09:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:09:24,657 INFO L225 Difference]: With dead ends: 3186 [2021-12-18 21:09:24,657 INFO L226 Difference]: Without dead ends: 3186 [2021-12-18 21:09:24,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6396 GetRequests, 5859 SyntacticMatches, 0 SemanticMatches, 537 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77886 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=48884, Invalid=241098, Unknown=0, NotChecked=0, Total=289982 [2021-12-18 21:09:24,672 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 408 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 32929 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 33004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 32929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:09:24,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 674 Invalid, 33004 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [75 Valid, 32929 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2021-12-18 21:09:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2021-12-18 21:09:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3186. [2021-12-18 21:09:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.0087912087912088) internal successors, (3213), 3185 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:09:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3213 transitions. [2021-12-18 21:09:24,688 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3213 transitions. Word has length 2968 [2021-12-18 21:09:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:09:24,689 INFO L470 AbstractCegarLoop]: Abstraction has 3186 states and 3213 transitions. [2021-12-18 21:09:24,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 136 states have (on average 6.294117647058823) internal successors, (856), 136 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:09:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3213 transitions. [2021-12-18 21:09:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2989 [2021-12-18 21:09:24,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:09:24,731 INFO L514 BasicCegarLoop]: trace histogram [554, 554, 553, 553, 553, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1] [2021-12-18 21:09:24,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2021-12-18 21:09:24,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-12-18 21:09:24,932 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:09:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:09:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash -956534366, now seen corresponding path program 26 times [2021-12-18 21:09:24,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:09:24,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665881538] [2021-12-18 21:09:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:09:24,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:09:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:09:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 785259 backedges. 336287 proven. 5729 refuted. 0 times theorem prover too weak. 443243 trivial. 0 not checked. [2021-12-18 21:09:27,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:09:27,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665881538] [2021-12-18 21:09:27,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665881538] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:09:27,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87183574] [2021-12-18 21:09:27,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:09:27,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:09:27,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:09:27,422 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:09:27,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-12-18 21:09:28,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:09:28,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:09:28,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 8820 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-18 21:09:28,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:09:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 785259 backedges. 658477 proven. 53782 refuted. 0 times theorem prover too weak. 73000 trivial. 0 not checked. [2021-12-18 21:09:34,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:09:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 785259 backedges. 658477 proven. 53782 refuted. 0 times theorem prover too weak. 73000 trivial. 0 not checked. [2021-12-18 21:09:39,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87183574] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:09:39,216 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:09:39,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 57, 57] total 141 [2021-12-18 21:09:39,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076566224] [2021-12-18 21:09:39,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:09:39,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2021-12-18 21:09:39,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:09:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2021-12-18 21:09:39,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2984, Invalid=16756, Unknown=0, NotChecked=0, Total=19740 [2021-12-18 21:09:39,221 INFO L87 Difference]: Start difference. First operand 3186 states and 3213 transitions. Second operand has 141 states, 141 states have (on average 6.297872340425532) internal successors, (888), 141 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:10:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:10:16,667 INFO L93 Difference]: Finished difference Result 3186 states and 3206 transitions. [2021-12-18 21:10:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 462 states. [2021-12-18 21:10:16,668 INFO L78 Accepts]: Start accepts. Automaton has has 141 states, 141 states have (on average 6.297872340425532) internal successors, (888), 141 states have internal predecessors, (888), 0 states have call successors, (0), 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 2988 [2021-12-18 21:10:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:10:16,671 INFO L225 Difference]: With dead ends: 3186 [2021-12-18 21:10:16,672 INFO L226 Difference]: Without dead ends: 3186 [2021-12-18 21:10:16,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6467 GetRequests, 5896 SyntacticMatches, 0 SemanticMatches, 571 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88437 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=55205, Invalid=272551, Unknown=0, NotChecked=0, Total=327756 [2021-12-18 21:10:16,690 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 424 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 41104 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 41178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 41104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:10:16,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 723 Invalid, 41178 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 41104 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2021-12-18 21:10:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2021-12-18 21:10:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3186. [2021-12-18 21:10:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.0065934065934066) internal successors, (3206), 3185 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:10:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3206 transitions. [2021-12-18 21:10:16,706 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3206 transitions. Word has length 2988 [2021-12-18 21:10:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:10:16,707 INFO L470 AbstractCegarLoop]: Abstraction has 3186 states and 3206 transitions. [2021-12-18 21:10:16,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 141 states have (on average 6.297872340425532) internal successors, (888), 141 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:10:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3206 transitions. [2021-12-18 21:10:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3004 [2021-12-18 21:10:16,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:10:16,850 INFO L514 BasicCegarLoop]: trace histogram [557, 557, 556, 556, 556, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1] [2021-12-18 21:10:16,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2021-12-18 21:10:17,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-12-18 21:10:17,075 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:10:17,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:10:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 514535459, now seen corresponding path program 27 times [2021-12-18 21:10:17,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:10:17,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289408272] [2021-12-18 21:10:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:10:17,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:10:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:10:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 793671 backedges. 342229 proven. 6152 refuted. 0 times theorem prover too weak. 445290 trivial. 0 not checked. [2021-12-18 21:10:19,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:10:19,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289408272] [2021-12-18 21:10:19,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289408272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:10:19,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856363874] [2021-12-18 21:10:19,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 21:10:19,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:10:19,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:10:19,667 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:10:19,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-12-18 21:10:34,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2021-12-18 21:10:34,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:10:34,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 4078 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-18 21:10:34,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:10:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 793671 backedges. 205158 proven. 101801 refuted. 0 times theorem prover too weak. 486712 trivial. 0 not checked. [2021-12-18 21:10:43,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:10:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 793671 backedges. 275732 proven. 31115 refuted. 0 times theorem prover too weak. 486824 trivial. 0 not checked. [2021-12-18 21:10:49,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856363874] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:10:49,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:10:49,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 75, 73] total 206 [2021-12-18 21:10:49,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384346499] [2021-12-18 21:10:49,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:10:49,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 206 states [2021-12-18 21:10:49,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:10:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2021-12-18 21:10:49,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5347, Invalid=36883, Unknown=0, NotChecked=0, Total=42230 [2021-12-18 21:10:49,902 INFO L87 Difference]: Start difference. First operand 3186 states and 3206 transitions. Second operand has 206 states, 206 states have (on average 5.004854368932039) internal successors, (1031), 206 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:11:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:11:08,491 INFO L93 Difference]: Finished difference Result 3527 states and 3543 transitions. [2021-12-18 21:11:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 318 states. [2021-12-18 21:11:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 206 states, 206 states have (on average 5.004854368932039) internal successors, (1031), 206 states have internal predecessors, (1031), 0 states have call successors, (0), 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 3003 [2021-12-18 21:11:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:11:08,496 INFO L225 Difference]: With dead ends: 3527 [2021-12-18 21:11:08,496 INFO L226 Difference]: Without dead ends: 3527 [2021-12-18 21:11:08,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6382 GetRequests, 5863 SyntacticMatches, 0 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83563 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=38577, Invalid=232343, Unknown=0, NotChecked=0, Total=270920 [2021-12-18 21:11:08,517 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 7549 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 14010 mSolverCounterSat, 1634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7549 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 15644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1634 IncrementalHoareTripleChecker+Valid, 14010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-18 21:11:08,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7549 Valid, 1209 Invalid, 15644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1634 Valid, 14010 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-12-18 21:11:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2021-12-18 21:11:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3019. [2021-12-18 21:11:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 3018 states have (on average 1.0036447978793903) internal successors, (3029), 3018 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:11:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3029 transitions. [2021-12-18 21:11:08,534 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3029 transitions. Word has length 3003 [2021-12-18 21:11:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:11:08,535 INFO L470 AbstractCegarLoop]: Abstraction has 3019 states and 3029 transitions. [2021-12-18 21:11:08,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 206 states, 206 states have (on average 5.004854368932039) internal successors, (1031), 206 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:11:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3029 transitions. [2021-12-18 21:11:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3019 [2021-12-18 21:11:08,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:11:08,578 INFO L514 BasicCegarLoop]: trace histogram [560, 560, 559, 559, 559, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1] [2021-12-18 21:11:08,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2021-12-18 21:11:08,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-12-18 21:11:08,779 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-12-18 21:11:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:11:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash 939509746, now seen corresponding path program 28 times [2021-12-18 21:11:08,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:11:08,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897361832] [2021-12-18 21:11:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:11:08,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:11:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:11:10,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 21:11:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:11:13,101 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 21:11:13,101 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 21:11:13,102 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (7 of 8 remaining) [2021-12-18 21:11:13,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (6 of 8 remaining) [2021-12-18 21:11:13,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (5 of 8 remaining) [2021-12-18 21:11:13,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (4 of 8 remaining) [2021-12-18 21:11:13,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (3 of 8 remaining) [2021-12-18 21:11:13,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (2 of 8 remaining) [2021-12-18 21:11:13,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (1 of 8 remaining) [2021-12-18 21:11:13,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2021-12-18 21:11:13,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-12-18 21:11:13,106 INFO L732 BasicCegarLoop]: Path program histogram: [28, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:11:13,110 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:11:13,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:11:13 BoogieIcfgContainer [2021-12-18 21:11:13,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:11:13,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:11:13,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:11:13,552 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:11:13,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:00:55" (3/4) ... [2021-12-18 21:11:13,553 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-18 21:11:14,015 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 21:11:14,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:11:14,016 INFO L158 Benchmark]: Toolchain (without parser) took 619150.54ms. Allocated memory was 127.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 103.1MB in the beginning and 1.0GB in the end (delta: -935.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-12-18 21:11:14,016 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:11:14,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.32ms. Allocated memory is still 127.9MB. Free memory was 102.7MB in the beginning and 103.6MB in the end (delta: -962.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 21:11:14,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.17ms. Allocated memory is still 127.9MB. Free memory was 103.6MB in the beginning and 102.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:11:14,016 INFO L158 Benchmark]: Boogie Preprocessor took 31.22ms. Allocated memory is still 127.9MB. Free memory was 102.4MB in the beginning and 101.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:11:14,017 INFO L158 Benchmark]: RCFGBuilder took 254.17ms. Allocated memory is still 127.9MB. Free memory was 101.1MB in the beginning and 90.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 21:11:14,017 INFO L158 Benchmark]: TraceAbstraction took 618215.20ms. Allocated memory was 127.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 89.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-18 21:11:14,021 INFO L158 Benchmark]: Witness Printer took 464.24ms. Allocated memory is still 2.3GB. Free memory was 1.2GB in the beginning and 1.0GB in the end (delta: 156.7MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2021-12-18 21:11:14,021 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.14ms. Allocated memory is still 127.9MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.32ms. Allocated memory is still 127.9MB. Free memory was 102.7MB in the beginning and 103.6MB in the end (delta: -962.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.17ms. Allocated memory is still 127.9MB. Free memory was 103.6MB in the beginning and 102.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.22ms. Allocated memory is still 127.9MB. Free memory was 102.4MB in the beginning and 101.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 254.17ms. Allocated memory is still 127.9MB. Free memory was 101.1MB in the beginning and 90.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 618215.20ms. Allocated memory was 127.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 89.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 464.24ms. Allocated memory is still 2.3GB. Free memory was 1.2GB in the beginning and 1.0GB in the end (delta: 156.7MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L24] int i, b[32]; [L25] char mask[32]; [L26] i = 0 VAL [b={34:0}, i=0, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i) [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L17] COND TRUE i <= size + 1 VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L18] EXPR a[i] VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L18] EXPR b[i] VAL [\old(size)=0, b={33:0}, b={33:0}, b[i]=150, i=0, size=0] [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] VAL [\old(size)=0, b={33:0}, b={33:0}, b[i]=139, i=1, size=0] [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) VAL [\old(size)=0, b={33:0}, b={33:0}, i=2, size=0] [L20] return i; VAL [\old(size)=0, \result=2, b={33:0}, b={33:0}, i=2, size=0] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=2, i=0, mask={33:0}] [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] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=150, i=0, size=1] [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] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=139, i=1, size=1] [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] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=134, i=2, size=1] [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) VAL [\old(size)=1, b={33:0}, b={33:0}, i=3, size=1] [L20] return i; VAL [\old(size)=1, \result=3, b={33:0}, b={33:0}, i=3, size=1] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=3, i=1, mask={33:0}] [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] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=150, i=0, size=2] [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] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=139, i=1, size=2] [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] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=134, i=2, size=2] [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] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=132, i=3, size=2] [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) VAL [\old(size)=2, b={33:0}, b={33:0}, i=4, size=2] [L20] return i; VAL [\old(size)=2, \result=4, b={33:0}, b={33:0}, i=4, size=2] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=4, i=2, mask={33:0}] [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] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=150, i=0, size=3] [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] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=139, i=1, size=3] [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] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=134, i=2, size=3] [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] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=132, i=3, size=3] [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] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=153, i=4, size=3] [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) VAL [\old(size)=3, b={33:0}, b={33:0}, i=5, size=3] [L20] return i; VAL [\old(size)=3, \result=5, b={33:0}, b={33:0}, i=5, size=3] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=5, i=3, mask={33:0}] [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] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=150, i=0, size=4] [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] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=139, i=1, size=4] [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] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=134, i=2, size=4] [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] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=132, i=3, size=4] [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] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=153, i=4, size=4] [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] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=158, i=5, size=4] [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) VAL [\old(size)=4, b={33:0}, b={33:0}, i=6, size=4] [L20] return i; VAL [\old(size)=4, \result=6, b={33:0}, b={33:0}, i=6, size=4] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=6, i=4, mask={33:0}] [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] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=150, i=0, size=5] [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] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=139, i=1, size=5] [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] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=134, i=2, size=5] [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] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=132, i=3, size=5] [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] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=153, i=4, size=5] [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] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=158, i=5, size=5] [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] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=138, i=6, size=5] [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) VAL [\old(size)=5, b={33:0}, b={33:0}, i=7, size=5] [L20] return i; VAL [\old(size)=5, \result=7, b={33:0}, b={33:0}, i=7, size=5] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=7, i=5, mask={33:0}] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=150, i=0, size=6] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=139, i=1, size=6] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=134, i=2, size=6] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=132, i=3, size=6] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=153, i=4, size=6] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=158, i=5, size=6] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=138, i=6, size=6] [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] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=151, i=7, size=6] [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) VAL [\old(size)=6, b={33:0}, b={33:0}, i=8, size=6] [L20] return i; VAL [\old(size)=6, \result=8, b={33:0}, b={33:0}, i=8, size=6] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=8, i=6, mask={33:0}] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=150, i=0, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=139, i=1, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=134, i=2, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=132, i=3, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=153, i=4, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=158, i=5, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=138, i=6, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=151, i=7, size=7] [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] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=131, i=8, size=7] [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) VAL [\old(size)=7, b={33:0}, b={33:0}, i=9, size=7] [L20] return i; VAL [\old(size)=7, \result=9, b={33:0}, b={33:0}, i=9, size=7] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=9, i=7, mask={33:0}] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=150, i=0, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=139, i=1, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=134, i=2, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=132, i=3, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=153, i=4, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=158, i=5, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=138, i=6, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=151, i=7, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=131, i=8, size=8] [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] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=154, i=9, size=8] [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) VAL [\old(size)=8, b={33:0}, b={33:0}, i=10, size=8] [L20] return i; VAL [\old(size)=8, \result=10, b={33:0}, b={33:0}, i=10, size=8] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=10, i=8, mask={33:0}] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=150, i=0, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=139, i=1, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=134, i=2, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=132, i=3, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=153, i=4, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=158, i=5, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=138, i=6, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=151, i=7, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=131, i=8, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=154, i=9, size=9] [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] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=147, i=10, size=9] [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) VAL [\old(size)=9, b={33:0}, b={33:0}, i=11, size=9] [L20] return i; VAL [\old(size)=9, \result=11, b={33:0}, b={33:0}, i=11, size=9] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=11, i=9, mask={33:0}] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=150, i=0, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=139, i=1, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=134, i=2, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=132, i=3, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=153, i=4, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=158, i=5, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=138, i=6, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=151, i=7, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=131, i=8, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=154, i=9, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=147, i=10, size=10] [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] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=145, i=11, size=10] [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) VAL [\old(size)=10, b={33:0}, b={33:0}, i=12, size=10] [L20] return i; VAL [\old(size)=10, \result=12, b={33:0}, b={33:0}, i=12, size=10] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=12, i=10, mask={33:0}] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=150, i=0, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=139, i=1, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=134, i=2, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=132, i=3, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=153, i=4, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=158, i=5, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=138, i=6, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=151, i=7, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=131, i=8, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=154, i=9, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=147, i=10, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=145, i=11, size=11] [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] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=140, i=12, size=11] [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) VAL [\old(size)=11, b={33:0}, b={33:0}, i=13, size=11] [L20] return i; VAL [\old(size)=11, \result=13, b={33:0}, b={33:0}, i=13, size=11] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=13, i=11, mask={33:0}] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=150, i=0, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=139, i=1, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=134, i=2, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=132, i=3, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=153, i=4, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=158, i=5, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=138, i=6, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=151, i=7, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=131, i=8, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=154, i=9, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=147, i=10, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=145, i=11, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=140, i=12, size=12] [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] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=130, i=13, size=12] [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) VAL [\old(size)=12, b={33:0}, b={33:0}, i=14, size=12] [L20] return i; VAL [\old(size)=12, \result=14, b={33:0}, b={33:0}, i=14, size=12] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=14, i=12, mask={33:0}] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=150, i=0, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=139, i=1, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=134, i=2, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=132, i=3, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=153, i=4, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=158, i=5, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=138, i=6, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=151, i=7, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=131, i=8, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=154, i=9, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=147, i=10, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=145, i=11, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=140, i=12, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=130, i=13, size=13] [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] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=160, i=14, size=13] [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) VAL [\old(size)=13, b={33:0}, b={33:0}, i=15, size=13] [L20] return i; VAL [\old(size)=13, \result=15, b={33:0}, b={33:0}, i=15, size=13] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=15, i=13, mask={33:0}] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=150, i=0, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=139, i=1, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=134, i=2, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=132, i=3, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=153, i=4, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=158, i=5, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=138, i=6, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=151, i=7, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=131, i=8, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=154, i=9, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=147, i=10, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=145, i=11, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=140, i=12, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=130, i=13, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=160, i=14, size=14] [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] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=159, i=15, size=14] [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) VAL [\old(size)=14, b={33:0}, b={33:0}, i=16, size=14] [L20] return i; VAL [\old(size)=14, \result=16, b={33:0}, b={33:0}, i=16, size=14] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=16, i=14, mask={33:0}] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=150, i=0, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=139, i=1, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=134, i=2, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=132, i=3, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=153, i=4, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=158, i=5, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=138, i=6, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=151, i=7, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=131, i=8, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=154, i=9, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=147, i=10, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=145, i=11, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=140, i=12, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=130, i=13, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=160, i=14, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=159, i=15, size=15] [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] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=133, i=16, size=15] [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) VAL [\old(size)=15, b={33:0}, b={33:0}, i=17, size=15] [L20] return i; VAL [\old(size)=15, \result=17, b={33:0}, b={33:0}, i=17, size=15] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=17, i=15, mask={33:0}] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=150, i=0, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=139, i=1, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=134, i=2, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=132, i=3, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=153, i=4, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=158, i=5, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=138, i=6, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=151, i=7, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=131, i=8, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=154, i=9, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=147, i=10, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=145, i=11, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=140, i=12, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=130, i=13, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=160, i=14, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=159, i=15, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=133, i=16, size=16] [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] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=155, i=17, size=16] [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) VAL [\old(size)=16, b={33:0}, b={33:0}, i=18, size=16] [L20] return i; VAL [\old(size)=16, \result=18, b={33:0}, b={33:0}, i=18, size=16] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=18, i=16, mask={33:0}] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=150, i=0, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=139, i=1, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=134, i=2, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=132, i=3, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=153, i=4, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=158, i=5, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=138, i=6, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=151, i=7, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=131, i=8, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=154, i=9, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=147, i=10, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=145, i=11, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=140, i=12, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=130, i=13, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=160, i=14, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=159, i=15, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=133, i=16, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=155, i=17, size=17] [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] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=143, i=18, size=17] [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) VAL [\old(size)=17, b={33:0}, b={33:0}, i=19, size=17] [L20] return i; VAL [\old(size)=17, \result=19, b={33:0}, b={33:0}, i=19, size=17] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=19, i=17, mask={33:0}] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=150, i=0, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=139, i=1, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=134, i=2, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=132, i=3, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=153, i=4, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=158, i=5, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=138, i=6, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=151, i=7, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=131, i=8, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=154, i=9, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=147, i=10, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=145, i=11, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=140, i=12, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=130, i=13, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=160, i=14, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=159, i=15, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=133, i=16, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=155, i=17, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=143, i=18, size=18] [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] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=144, i=19, size=18] [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) VAL [\old(size)=18, b={33:0}, b={33:0}, i=20, size=18] [L20] return i; VAL [\old(size)=18, \result=20, b={33:0}, b={33:0}, i=20, size=18] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=20, i=18, mask={33:0}] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=150, i=0, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=139, i=1, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=134, i=2, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=132, i=3, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=153, i=4, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=158, i=5, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=138, i=6, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=151, i=7, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=131, i=8, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=154, i=9, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=147, i=10, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=145, i=11, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=140, i=12, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=130, i=13, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=160, i=14, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=159, i=15, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=133, i=16, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=155, i=17, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=143, i=18, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=144, i=19, size=19] [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] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=129, i=20, size=19] [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) VAL [\old(size)=19, b={33:0}, b={33:0}, i=21, size=19] [L20] return i; VAL [\old(size)=19, \result=21, b={33:0}, b={33:0}, i=21, size=19] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=21, i=19, mask={33:0}] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=150, i=0, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=139, i=1, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=134, i=2, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=132, i=3, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=153, i=4, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=158, i=5, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=138, i=6, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=151, i=7, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=131, i=8, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=154, i=9, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=147, i=10, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=145, i=11, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=140, i=12, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=130, i=13, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=160, i=14, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=159, i=15, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=133, i=16, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=155, i=17, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=143, i=18, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=144, i=19, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=129, i=20, size=20] [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] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=149, i=21, size=20] [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) VAL [\old(size)=20, b={33:0}, b={33:0}, i=22, size=20] [L20] return i; VAL [\old(size)=20, \result=22, b={33:0}, b={33:0}, i=22, size=20] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=22, i=20, mask={33:0}] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=150, i=0, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=139, i=1, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=134, i=2, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=132, i=3, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=153, i=4, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=158, i=5, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=138, i=6, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=151, i=7, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=131, i=8, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=154, i=9, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=147, i=10, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=145, i=11, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=140, i=12, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=130, i=13, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=160, i=14, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=159, i=15, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=133, i=16, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=155, i=17, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=143, i=18, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=144, i=19, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=129, i=20, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=149, i=21, size=21] [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] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=136, i=22, size=21] [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) VAL [\old(size)=21, b={33:0}, b={33:0}, i=23, size=21] [L20] return i; VAL [\old(size)=21, \result=23, b={33:0}, b={33:0}, i=23, size=21] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=23, i=21, mask={33:0}] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=150, i=0, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=139, i=1, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=134, i=2, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=132, i=3, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=153, i=4, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=158, i=5, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=138, i=6, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=151, i=7, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=131, i=8, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=154, i=9, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=147, i=10, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=145, i=11, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=140, i=12, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=130, i=13, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=160, i=14, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=159, i=15, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=133, i=16, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=155, i=17, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=143, i=18, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=144, i=19, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=129, i=20, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=149, i=21, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=136, i=22, size=22] [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] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=142, i=23, size=22] [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) VAL [\old(size)=22, b={33:0}, b={33:0}, i=24, size=22] [L20] return i; VAL [\old(size)=22, \result=24, b={33:0}, b={33:0}, i=24, size=22] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=24, i=22, mask={33:0}] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=150, i=0, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=139, i=1, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=134, i=2, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=132, i=3, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=153, i=4, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=158, i=5, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=138, i=6, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=151, i=7, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=131, i=8, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=154, i=9, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=147, i=10, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=145, i=11, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=140, i=12, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=130, i=13, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=160, i=14, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=159, i=15, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=133, i=16, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=155, i=17, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=143, i=18, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=144, i=19, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=129, i=20, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=149, i=21, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=136, i=22, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=142, i=23, size=23] [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] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=137, i=24, size=23] [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) VAL [\old(size)=23, b={33:0}, b={33:0}, i=25, size=23] [L20] return i; VAL [\old(size)=23, \result=25, b={33:0}, b={33:0}, i=25, size=23] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=25, i=23, mask={33:0}] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=150, i=0, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=139, i=1, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=134, i=2, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=132, i=3, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=153, i=4, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=158, i=5, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=138, i=6, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=151, i=7, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=131, i=8, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=154, i=9, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=147, i=10, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=145, i=11, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=140, i=12, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=130, i=13, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=160, i=14, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=159, i=15, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=133, i=16, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=155, i=17, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=143, i=18, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=144, i=19, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=129, i=20, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=149, i=21, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=136, i=22, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=142, i=23, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=137, i=24, size=24] [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] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=148, i=25, size=24] [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) VAL [\old(size)=24, b={33:0}, b={33:0}, i=26, size=24] [L20] return i; VAL [\old(size)=24, \result=26, b={33:0}, b={33:0}, i=26, size=24] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=26, i=24, mask={33:0}] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=150, i=0, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=139, i=1, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=134, i=2, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=132, i=3, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=153, i=4, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=158, i=5, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=138, i=6, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=151, i=7, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=131, i=8, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=154, i=9, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=147, i=10, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=145, i=11, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=140, i=12, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=130, i=13, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=160, i=14, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=159, i=15, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=133, i=16, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=155, i=17, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=143, i=18, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=144, i=19, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=129, i=20, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=149, i=21, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=136, i=22, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=142, i=23, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=137, i=24, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=148, i=25, size=25] [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] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=157, i=26, size=25] [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) VAL [\old(size)=25, b={33:0}, b={33:0}, i=27, size=25] [L20] return i; VAL [\old(size)=25, \result=27, b={33:0}, b={33:0}, i=27, size=25] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=27, i=25, mask={33:0}] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=150, i=0, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=139, i=1, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=134, i=2, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=132, i=3, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=153, i=4, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=158, i=5, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=138, i=6, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=151, i=7, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=131, i=8, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=154, i=9, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=147, i=10, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=145, i=11, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=140, i=12, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=130, i=13, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=160, i=14, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=159, i=15, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=133, i=16, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=155, i=17, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=143, i=18, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=144, i=19, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=129, i=20, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=149, i=21, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=136, i=22, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=142, i=23, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=137, i=24, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=148, i=25, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=157, i=26, size=26] [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] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=135, i=27, size=26] [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) VAL [\old(size)=26, b={33:0}, b={33:0}, i=28, size=26] [L20] return i; VAL [\old(size)=26, \result=28, b={33:0}, b={33:0}, i=28, size=26] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=28, i=26, mask={33:0}] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=150, i=0, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=139, i=1, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=134, i=2, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=132, i=3, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=153, i=4, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=158, i=5, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=138, i=6, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=151, i=7, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=131, i=8, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=154, i=9, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=147, i=10, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=145, i=11, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=140, i=12, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=130, i=13, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=160, i=14, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=159, i=15, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=133, i=16, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=155, i=17, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=143, i=18, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=144, i=19, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=129, i=20, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=149, i=21, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=136, i=22, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=142, i=23, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=137, i=24, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=148, i=25, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=157, i=26, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=135, i=27, size=27] [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] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=146, i=28, size=27] [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) VAL [\old(size)=27, b={33:0}, b={33:0}, i=29, size=27] [L20] return i; VAL [\old(size)=27, \result=29, b={33:0}, b={33:0}, i=29, size=27] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=29, i=27, mask={33:0}] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=150, i=0, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=139, i=1, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=134, i=2, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=132, i=3, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=153, i=4, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=158, i=5, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=138, i=6, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=151, i=7, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=131, i=8, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=154, i=9, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=147, i=10, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=145, i=11, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=140, i=12, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=130, i=13, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=160, i=14, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=159, i=15, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=133, i=16, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=155, i=17, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=143, i=18, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=144, i=19, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=129, i=20, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=149, i=21, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=136, i=22, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=142, i=23, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=137, i=24, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=148, i=25, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=157, i=26, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=135, i=27, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=146, i=28, size=28] [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] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=156, i=29, size=28] [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) VAL [\old(size)=28, b={33:0}, b={33:0}, i=30, size=28] [L20] return i; VAL [\old(size)=28, \result=30, b={33:0}, b={33:0}, i=30, size=28] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=30, i=28, mask={33:0}] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=150, i=0, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=139, i=1, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=134, i=2, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=132, i=3, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=153, i=4, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=158, i=5, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=138, i=6, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=151, i=7, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=131, i=8, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=154, i=9, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=147, i=10, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=145, i=11, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=140, i=12, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=130, i=13, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=160, i=14, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=159, i=15, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=133, i=16, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=155, i=17, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=143, i=18, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=144, i=19, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=129, i=20, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=149, i=21, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=136, i=22, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=142, i=23, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=137, i=24, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=148, i=25, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=157, i=26, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=135, i=27, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=146, i=28, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=156, i=29, size=29] [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] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=152, i=30, size=29] [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) VAL [\old(size)=29, b={33:0}, b={33:0}, i=31, size=29] [L20] return i; VAL [\old(size)=29, \result=31, b={33:0}, b={33:0}, i=31, size=29] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=31, i=29, mask={33:0}] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=150, i=0, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=139, i=1, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=134, i=2, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=132, i=3, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=153, i=4, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=158, i=5, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=138, i=6, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=151, i=7, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=131, i=8, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=154, i=9, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=147, i=10, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=145, i=11, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=140, i=12, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=130, i=13, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=160, i=14, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=159, i=15, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=133, i=16, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=155, i=17, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=143, i=18, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=144, i=19, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=129, i=20, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=149, i=21, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=136, i=22, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=142, i=23, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=137, i=24, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=148, i=25, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=157, i=26, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=135, i=27, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=146, i=28, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=156, i=29, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=152, i=30, size=30] [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] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=141, i=31, size=30] [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) VAL [\old(size)=30, b={33:0}, b={33:0}, i=32, size=30] [L20] return i; VAL [\old(size)=30, \result=32, b={33:0}, b={33:0}, i=32, size=30] [L27] RET, EXPR foo(mask, i) [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=32, i=30, mask={33:0}] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=150, i=0, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=139, i=1, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=134, i=2, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=132, i=3, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=153, i=4, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=158, i=5, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=138, i=6, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=151, i=7, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=131, i=8, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=154, i=9, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=147, i=10, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=145, i=11, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=140, i=12, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=130, i=13, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=160, i=14, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=159, i=15, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=133, i=16, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=155, i=17, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=143, i=18, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=144, i=19, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=129, i=20, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=149, i=21, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=136, i=22, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=142, i=23, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=137, i=24, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=148, i=25, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=157, i=26, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=135, i=27, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=146, i=28, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=156, i=29, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=152, i=30, size=31] [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] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=141, i=31, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L18] a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L18] b[i] - UnprovableResult [Line: 18]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 617.7s, OverallIterations: 51, TraceHistogramMax: 560, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.6s, AutomataDifference: 289.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45790 SdHoareTripleChecker+Valid, 74.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45790 mSDsluCounter, 12316 SdHoareTripleChecker+Invalid, 61.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 21 IncrementalHoareTripleChecker+Unchecked, 10957 mSDsCounter, 10541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241379 IncrementalHoareTripleChecker+Invalid, 251941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10541 mSolverCounterUnsat, 1359 mSDtfsCounter, 241379 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80470 GetRequests, 72266 SyntacticMatches, 21 SemanticMatches, 8183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329450 ImplicationChecksByTransitivity, 244.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3946occurred in iteration=45, InterpolantAutomatonStates: 6078, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 50 MinimizatonAttempts, 4012 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3.0s SsaConstructionTime, 119.8s SatisfiabilityAnalysisTime, 185.9s InterpolantComputationTime, 77057 NumberOfCodeBlocks, 68591 NumberOfCodeBlocksAsserted, 563 NumberOfCheckSat, 110697 ConstructedInterpolants, 107 QuantifiedInterpolants, 352839 SizeOfPredicates, 259 NumberOfNonLiveVariables, 86352 ConjunctsInSsa, 1311 ConjunctsInUnsatCore, 131 InterpolantComputations, 11 PerfectInterpolantSequences, 17061055/19472020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-18 21:11:14,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)