./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf 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/memsafety/960521-1-3.i -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 aea2263a6208d6a52173fd0d6e32c8964eb048b7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 17:01:14,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 17:01:14,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 17:01:14,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 17:01:14,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 17:01:14,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 17:01:14,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 17:01:14,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 17:01:14,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 17:01:14,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 17:01:14,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 17:01:14,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 17:01:14,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 17:01:14,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 17:01:14,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 17:01:14,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 17:01:14,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 17:01:14,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 17:01:14,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 17:01:14,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 17:01:14,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 17:01:14,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 17:01:14,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 17:01:14,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 17:01:14,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 17:01:14,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 17:01:14,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 17:01:14,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 17:01:14,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 17:01:14,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 17:01:14,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 17:01:14,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 17:01:14,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 17:01:14,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 17:01:14,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 17:01:14,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 17:01:14,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 17:01:14,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 17:01:14,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 17:01:14,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 17:01:14,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 17:01:14,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-30 17:01:14,810 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 17:01:14,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 17:01:14,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 17:01:14,812 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 17:01:14,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 17:01:14,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 17:01:14,814 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 17:01:14,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 17:01:14,815 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 17:01:14,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 17:01:14,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 17:01:14,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 17:01:14,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 17:01:14,816 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 17:01:14,816 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 17:01:14,817 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 17:01:14,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 17:01:14,817 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 17:01:14,817 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 17:01:14,817 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 17:01:14,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 17:01:14,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 17:01:14,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 17:01:14,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:01:14,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 17:01:14,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 17:01:14,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 17:01:14,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 17:01:14,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 17:01:14,819 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 -> aea2263a6208d6a52173fd0d6e32c8964eb048b7 [2021-08-30 17:01:15,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 17:01:15,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 17:01:15,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 17:01:15,226 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 17:01:15,227 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 17:01:15,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-3.i [2021-08-30 17:01:15,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3250dbea1/2c09a0c6dea54f9181a245c4de9f0985/FLAGc3b193de0 [2021-08-30 17:01:15,827 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 17:01:15,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-3.i [2021-08-30 17:01:15,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3250dbea1/2c09a0c6dea54f9181a245c4de9f0985/FLAGc3b193de0 [2021-08-30 17:01:16,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3250dbea1/2c09a0c6dea54f9181a245c4de9f0985 [2021-08-30 17:01:16,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 17:01:16,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 17:01:16,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 17:01:16,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 17:01:16,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 17:01:16,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6e83a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16, skipping insertion in model container [2021-08-30 17:01:16,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 17:01:16,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:01:16,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:01:16,468 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 17:01:16,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:01:16,547 INFO L208 MainTranslator]: Completed translation [2021-08-30 17:01:16,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16 WrapperNode [2021-08-30 17:01:16,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 17:01:16,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 17:01:16,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 17:01:16,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 17:01:16,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 17:01:16,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 17:01:16,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 17:01:16,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 17:01:16,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (1/1) ... [2021-08-30 17:01:16,620 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:01:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:16,639 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-08-30 17:01:16,644 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-08-30 17:01:16,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 17:01:16,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 17:01:16,671 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-30 17:01:16,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-30 17:01:16,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-30 17:01:16,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-30 17:01:16,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-30 17:01:16,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-30 17:01:16,672 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-08-30 17:01:16,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 17:01:16,672 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-30 17:01:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-30 17:01:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-30 17:01:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-30 17:01:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-30 17:01:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 17:01:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-30 17:01:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-30 17:01:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-30 17:01:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-30 17:01:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-30 17:01:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-30 17:01:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-30 17:01:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-30 17:01:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-30 17:01:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-30 17:01:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-30 17:01:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-30 17:01:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-30 17:01:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-30 17:01:16,675 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-30 17:01:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-30 17:01:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-30 17:01:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-30 17:01:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-30 17:01:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-30 17:01:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-30 17:01:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-30 17:01:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-30 17:01:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-30 17:01:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-30 17:01:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-30 17:01:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-30 17:01:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-30 17:01:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-30 17:01:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-30 17:01:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-30 17:01:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-30 17:01:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-30 17:01:16,679 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-30 17:01:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-30 17:01:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-30 17:01:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-30 17:01:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-30 17:01:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-30 17:01:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-30 17:01:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-30 17:01:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-30 17:01:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-30 17:01:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-30 17:01:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-30 17:01:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-30 17:01:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-30 17:01:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-30 17:01:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-30 17:01:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-30 17:01:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-30 17:01:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-30 17:01:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-30 17:01:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-30 17:01:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-30 17:01:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-30 17:01:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-30 17:01:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-30 17:01:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-30 17:01:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-30 17:01:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-30 17:01:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-30 17:01:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-30 17:01:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-30 17:01:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-30 17:01:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-30 17:01:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-30 17:01:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-30 17:01:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-30 17:01:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-30 17:01:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-30 17:01:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-30 17:01:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-30 17:01:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-30 17:01:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-30 17:01:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-30 17:01:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-30 17:01:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-30 17:01:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-30 17:01:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-30 17:01:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-30 17:01:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-30 17:01:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-30 17:01:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-30 17:01:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-30 17:01:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-30 17:01:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-30 17:01:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-30 17:01:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-30 17:01:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-30 17:01:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-30 17:01:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-30 17:01:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-30 17:01:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-30 17:01:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-30 17:01:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-30 17:01:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-30 17:01:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-30 17:01:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-30 17:01:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-30 17:01:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-30 17:01:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-30 17:01:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-30 17:01:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-30 17:01:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-30 17:01:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-30 17:01:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-08-30 17:01:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-30 17:01:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 17:01:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-30 17:01:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-30 17:01:16,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 17:01:16,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 17:01:16,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-30 17:01:16,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 17:01:17,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 17:01:17,145 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-30 17:01:17,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:01:17 BoogieIcfgContainer [2021-08-30 17:01:17,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 17:01:17,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 17:01:17,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 17:01:17,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 17:01:17,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:01:16" (1/3) ... [2021-08-30 17:01:17,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cd3b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:01:17, skipping insertion in model container [2021-08-30 17:01:17,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:01:16" (2/3) ... [2021-08-30 17:01:17,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cd3b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:01:17, skipping insertion in model container [2021-08-30 17:01:17,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:01:17" (3/3) ... [2021-08-30 17:01:17,162 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1-3.i [2021-08-30 17:01:17,167 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 17:01:17,167 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-08-30 17:01:17,213 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 17:01:17,227 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, mConcurrency=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-08-30 17:01:17,227 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-08-30 17:01:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:01:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-30 17:01:17,260 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:17,261 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:17,261 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1574615304, now seen corresponding path program 1 times [2021-08-30 17:01:17,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:17,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924450906] [2021-08-30 17:01:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:17,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:17,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:17,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:17,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924450906] [2021-08-30 17:01:17,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924450906] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:01:17,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:01:17,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:01:17,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532761366] [2021-08-30 17:01:17,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:01:17,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:01:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:01:17,634 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:17,827 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2021-08-30 17:01:17,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:01:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-30 17:01:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:17,838 INFO L225 Difference]: With dead ends: 58 [2021-08-30 17:01:17,838 INFO L226 Difference]: Without dead ends: 55 [2021-08-30 17:01:17,840 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.47ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:01:17,844 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 127.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.41ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 155.44ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:17,845 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 148 Unknown, 0 Unchecked, 6.41ms Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 155.44ms Time] [2021-08-30 17:01:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-08-30 17:01:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-08-30 17:01:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 49 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-08-30 17:01:17,875 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 7 [2021-08-30 17:01:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:17,876 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-08-30 17:01:17,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-08-30 17:01:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-30 17:01:17,877 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:17,877 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:17,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 17:01:17,877 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1574615305, now seen corresponding path program 1 times [2021-08-30 17:01:17,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:17,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6690700] [2021-08-30 17:01:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:17,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:17,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:17,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6690700] [2021-08-30 17:01:17,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6690700] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:01:17,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:01:17,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:01:17,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337597023] [2021-08-30 17:01:17,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:01:17,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:17,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:01:17,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:01:17,960 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:18,067 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2021-08-30 17:01:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:01:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-30 17:01:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:18,068 INFO L225 Difference]: With dead ends: 54 [2021-08-30 17:01:18,068 INFO L226 Difference]: Without dead ends: 54 [2021-08-30 17:01:18,069 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.07ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:01:18,070 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.73ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.83ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:18,070 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 140 Unknown, 0 Unchecked, 1.73ms Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 96.83ms Time] [2021-08-30 17:01:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-30 17:01:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-08-30 17:01:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.7) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-08-30 17:01:18,076 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 7 [2021-08-30 17:01:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:18,076 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-08-30 17:01:18,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-08-30 17:01:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 17:01:18,077 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:18,077 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:18,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 17:01:18,077 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:18,078 INFO L82 PathProgramCache]: Analyzing trace with hash -132353852, now seen corresponding path program 1 times [2021-08-30 17:01:18,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:18,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606162094] [2021-08-30 17:01:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:18,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:18,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:18,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:18,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606162094] [2021-08-30 17:01:18,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606162094] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:01:18,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:01:18,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:01:18,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066292244] [2021-08-30 17:01:18,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:01:18,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:18,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:01:18,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:01:18,161 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:18,309 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2021-08-30 17:01:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:01:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-30 17:01:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:18,312 INFO L225 Difference]: With dead ends: 51 [2021-08-30 17:01:18,316 INFO L226 Difference]: Without dead ends: 51 [2021-08-30 17:01:18,318 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.64ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:01:18,323 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.75ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.07ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:18,325 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 11 Invalid, 126 Unknown, 0 Unchecked, 3.75ms Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 93.07ms Time] [2021-08-30 17:01:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-08-30 17:01:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-08-30 17:01:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.6) internal successors, (48), 45 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-08-30 17:01:18,336 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 12 [2021-08-30 17:01:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:18,336 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-30 17:01:18,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2021-08-30 17:01:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 17:01:18,337 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:18,337 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:18,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-30 17:01:18,338 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -132353851, now seen corresponding path program 1 times [2021-08-30 17:01:18,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:18,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785693423] [2021-08-30 17:01:18,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:18,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:18,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:18,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785693423] [2021-08-30 17:01:18,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785693423] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:01:18,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:01:18,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 17:01:18,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645280729] [2021-08-30 17:01:18,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:01:18,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:01:18,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:01:18,468 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:18,671 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-08-30 17:01:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:01:18,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-30 17:01:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:18,672 INFO L225 Difference]: With dead ends: 57 [2021-08-30 17:01:18,673 INFO L226 Difference]: Without dead ends: 57 [2021-08-30 17:01:18,673 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 109.21ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:01:18,674 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 78 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.42ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.51ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:18,674 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 11 Invalid, 141 Unknown, 0 Unchecked, 2.42ms Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 128.51ms Time] [2021-08-30 17:01:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-08-30 17:01:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2021-08-30 17:01:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2021-08-30 17:01:18,678 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 12 [2021-08-30 17:01:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:18,678 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2021-08-30 17:01:18,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2021-08-30 17:01:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 17:01:18,679 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:18,679 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:18,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-30 17:01:18,679 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting fooErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash -173587642, now seen corresponding path program 1 times [2021-08-30 17:01:18,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:18,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058292808] [2021-08-30 17:01:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:18,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:18,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:18,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:18,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058292808] [2021-08-30 17:01:18,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058292808] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:18,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306161448] [2021-08-30 17:01:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:18,818 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:18,825 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-08-30 17:01:18,834 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-08-30 17:01:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:18,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:01:18,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:19,049 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-30 17:01:19,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2021-08-30 17:01:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:19,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:01:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:19,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306161448] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:01:19,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:01:19,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2021-08-30 17:01:19,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038867029] [2021-08-30 17:01:19,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-30 17:01:19,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:19,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-30 17:01:19,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-30 17:01:19,443 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:20,009 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2021-08-30 17:01:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 17:01:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-30 17:01:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:20,012 INFO L225 Difference]: With dead ends: 73 [2021-08-30 17:01:20,012 INFO L226 Difference]: Without dead ends: 73 [2021-08-30 17:01:20,012 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 400.32ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-08-30 17:01:20,013 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 122 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 236.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.17ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 290.12ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:20,013 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 23 Invalid, 437 Unknown, 0 Unchecked, 4.17ms Time], IncrementalHoareTripleChecker [31 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 290.12ms Time] [2021-08-30 17:01:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-30 17:01:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2021-08-30 17:01:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-08-30 17:01:20,025 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2021-08-30 17:01:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:20,028 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-08-30 17:01:20,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-08-30 17:01:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-30 17:01:20,030 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:20,030 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:20,053 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-08-30 17:01:20,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:20,231 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting fooErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:20,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1682280059, now seen corresponding path program 2 times [2021-08-30 17:01:20,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:20,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238359606] [2021-08-30 17:01:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:20,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:20,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:20,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238359606] [2021-08-30 17:01:20,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238359606] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:20,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771291150] [2021-08-30 17:01:20,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:01:20,468 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:20,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:20,473 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-08-30 17:01:20,475 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-08-30 17:01:20,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:01:20,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:01:20,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 17:01:20,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:20,653 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-30 17:01:20,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 13 treesize of output 15 [2021-08-30 17:01:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:20,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:01:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:21,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771291150] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:01:21,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:01:21,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2021-08-30 17:01:21,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913341334] [2021-08-30 17:01:21,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-30 17:01:21,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-30 17:01:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-08-30 17:01:21,527 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:22,445 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-08-30 17:01:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-30 17:01:22,445 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-30 17:01:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:22,446 INFO L225 Difference]: With dead ends: 98 [2021-08-30 17:01:22,447 INFO L226 Difference]: Without dead ends: 98 [2021-08-30 17:01:22,447 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 803.20ms TimeCoverageRelationStatistics Valid=367, Invalid=823, Unknown=0, NotChecked=0, Total=1190 [2021-08-30 17:01:22,448 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 297 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 343.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.59ms SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 422.39ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:22,448 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 10 Invalid, 679 Unknown, 0 Unchecked, 5.59ms Time], IncrementalHoareTripleChecker [88 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 422.39ms Time] [2021-08-30 17:01:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-30 17:01:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2021-08-30 17:01:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-08-30 17:01:22,454 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 24 [2021-08-30 17:01:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:22,454 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-08-30 17:01:22,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-08-30 17:01:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-30 17:01:22,455 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:22,455 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:22,485 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-08-30 17:01:22,672 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,SelfDestructingSolverStorable5 [2021-08-30 17:01:22,673 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1604478801, now seen corresponding path program 1 times [2021-08-30 17:01:22,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:22,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162788328] [2021-08-30 17:01:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:22,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-08-30 17:01:22,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:22,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162788328] [2021-08-30 17:01:22,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162788328] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:01:22,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:01:22,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:01:22,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343343150] [2021-08-30 17:01:22,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:01:22,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:01:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:01:22,754 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:22,859 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-08-30 17:01:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:01:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-30 17:01:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:22,860 INFO L225 Difference]: With dead ends: 66 [2021-08-30 17:01:22,860 INFO L226 Difference]: Without dead ends: 66 [2021-08-30 17:01:22,861 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 45.83ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-30 17:01:22,861 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.30ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:22,861 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 11 Invalid, 141 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 77.30ms Time] [2021-08-30 17:01:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-30 17:01:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-08-30 17:01:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.28) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-08-30 17:01:22,865 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 32 [2021-08-30 17:01:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:22,865 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-08-30 17:01:22,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-08-30 17:01:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-30 17:01:22,866 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:22,866 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:22,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-30 17:01:22,867 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting fooErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1604478800, now seen corresponding path program 1 times [2021-08-30 17:01:22,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:22,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785727840] [2021-08-30 17:01:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:22,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:22,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:22,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785727840] [2021-08-30 17:01:22,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785727840] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:22,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325437891] [2021-08-30 17:01:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:22,976 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:22,977 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-08-30 17:01:22,978 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-08-30 17:01:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:23,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:01:23,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:23,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:01:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:23,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325437891] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:01:23,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:01:23,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2021-08-30 17:01:23,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122285368] [2021-08-30 17:01:23,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-30 17:01:23,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:23,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-30 17:01:23,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2021-08-30 17:01:23,447 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:24,232 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2021-08-30 17:01:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-30 17:01:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-30 17:01:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:24,234 INFO L225 Difference]: With dead ends: 147 [2021-08-30 17:01:24,234 INFO L226 Difference]: Without dead ends: 147 [2021-08-30 17:01:24,235 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 641.25ms TimeCoverageRelationStatistics Valid=574, Invalid=1066, Unknown=0, NotChecked=0, Total=1640 [2021-08-30 17:01:24,235 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 363 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 251.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.78ms SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 319.63ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:24,236 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 23 Invalid, 454 Unknown, 0 Unchecked, 4.78ms Time], IncrementalHoareTripleChecker [106 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 319.63ms Time] [2021-08-30 17:01:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-30 17:01:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2021-08-30 17:01:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 99 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2021-08-30 17:01:24,242 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 32 [2021-08-30 17:01:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:24,243 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2021-08-30 17:01:24,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2021-08-30 17:01:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-30 17:01:24,244 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:24,244 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:24,280 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-08-30 17:01:24,473 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-08-30 17:01:24,473 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting fooErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash -920733136, now seen corresponding path program 2 times [2021-08-30 17:01:24,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:24,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776122996] [2021-08-30 17:01:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:24,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:24,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:01:24,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:24,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776122996] [2021-08-30 17:01:24,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776122996] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:24,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626802966] [2021-08-30 17:01:24,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:01:24,739 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:24,740 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-08-30 17:01:24,742 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-08-30 17:01:24,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 17:01:24,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:01:24,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 17:01:24,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:24,876 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-30 17:01:24,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 18 [2021-08-30 17:01:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2021-08-30 17:01:25,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:01:25,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626802966] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:01:25,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:01:25,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [19] total 21 [2021-08-30 17:01:25,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208906365] [2021-08-30 17:01:25,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:01:25,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:01:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2021-08-30 17:01:25,319 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:25,352 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2021-08-30 17:01:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:01:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-08-30 17:01:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:25,354 INFO L225 Difference]: With dead ends: 81 [2021-08-30 17:01:25,354 INFO L226 Difference]: Without dead ends: 81 [2021-08-30 17:01:25,355 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 176.71ms TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2021-08-30 17:01:25,355 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.39ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.74ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:25,356 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.39ms Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 30.74ms Time] [2021-08-30 17:01:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-30 17:01:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-08-30 17:01:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-08-30 17:01:25,361 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 56 [2021-08-30 17:01:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:25,361 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-08-30 17:01:25,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-08-30 17:01:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-30 17:01:25,363 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:25,363 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:25,388 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-08-30 17:01:25,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:25,585 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting fooErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1899675668, now seen corresponding path program 1 times [2021-08-30 17:01:25,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:25,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179545003] [2021-08-30 17:01:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:25,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:25,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:01:25,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:25,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179545003] [2021-08-30 17:01:25,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179545003] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:25,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442493543] [2021-08-30 17:01:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:25,830 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:25,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:25,831 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-08-30 17:01:25,832 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-08-30 17:01:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:25,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-30 17:01:25,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:01:26,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:01:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:01:26,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442493543] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:01:26,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:01:26,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2021-08-30 17:01:26,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831327758] [2021-08-30 17:01:26,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-08-30 17:01:26,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:26,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-30 17:01:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=1421, Unknown=0, NotChecked=0, Total=2450 [2021-08-30 17:01:26,832 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 50 states, 50 states have (on average 2.92) internal successors, (146), 49 states have internal predecessors, (146), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:28,469 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2021-08-30 17:01:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-30 17:01:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 49 states have internal predecessors, (146), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-08-30 17:01:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:28,474 INFO L225 Difference]: With dead ends: 250 [2021-08-30 17:01:28,474 INFO L226 Difference]: Without dead ends: 250 [2021-08-30 17:01:28,490 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 1701.55ms TimeCoverageRelationStatistics Valid=2234, Invalid=4246, Unknown=0, NotChecked=0, Total=6480 [2021-08-30 17:01:28,490 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 819 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 352.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.81ms SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 432.47ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:28,490 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 23 Invalid, 616 Unknown, 0 Unchecked, 5.81ms Time], IncrementalHoareTripleChecker [264 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 432.47ms Time] [2021-08-30 17:01:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-08-30 17:01:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 153. [2021-08-30 17:01:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 146 states have (on average 1.1095890410958904) internal successors, (162), 147 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2021-08-30 17:01:28,509 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 59 [2021-08-30 17:01:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:28,509 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2021-08-30 17:01:28,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 49 states have internal predecessors, (146), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2021-08-30 17:01:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-30 17:01:28,510 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:28,510 INFO L513 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:28,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-30 17:01:28,710 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,SelfDestructingSolverStorable9 [2021-08-30 17:01:28,711 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting fooErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1638767852, now seen corresponding path program 2 times [2021-08-30 17:01:28,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:28,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348182657] [2021-08-30 17:01:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:28,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:29,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:01:29,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:29,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348182657] [2021-08-30 17:01:29,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348182657] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:29,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141608848] [2021-08-30 17:01:29,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:01:29,287 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:29,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:29,288 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-08-30 17:01:29,312 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-08-30 17:01:29,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:01:29,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:01:29,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-30 17:01:29,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:01:30,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:01:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:01:31,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141608848] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:01:31,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:01:31,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 98 [2021-08-30 17:01:31,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812958697] [2021-08-30 17:01:31,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-08-30 17:01:31,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-08-30 17:01:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4101, Invalid=5405, Unknown=0, NotChecked=0, Total=9506 [2021-08-30 17:01:31,897 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 98 states, 98 states have (on average 2.9591836734693877) internal successors, (290), 97 states have internal predecessors, (290), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:36,229 INFO L93 Difference]: Finished difference Result 506 states and 537 transitions. [2021-08-30 17:01:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-30 17:01:36,230 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.9591836734693877) internal successors, (290), 97 states have internal predecessors, (290), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-08-30 17:01:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:36,232 INFO L225 Difference]: With dead ends: 506 [2021-08-30 17:01:36,233 INFO L226 Difference]: Without dead ends: 506 [2021-08-30 17:01:36,237 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7807 ImplicationChecksByTransitivity, 5065.30ms TimeCoverageRelationStatistics Valid=8818, Invalid=16942, Unknown=0, NotChecked=0, Total=25760 [2021-08-30 17:01:36,238 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 1905 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 678.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.43ms SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 851.14ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:36,238 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1936 Valid, 23 Invalid, 1195 Unknown, 0 Unchecked, 10.43ms Time], IncrementalHoareTripleChecker [568 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 851.14ms Time] [2021-08-30 17:01:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-08-30 17:01:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 297. [2021-08-30 17:01:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 290 states have (on average 1.110344827586207) internal successors, (322), 291 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 327 transitions. [2021-08-30 17:01:36,254 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 327 transitions. Word has length 107 [2021-08-30 17:01:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:36,254 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 327 transitions. [2021-08-30 17:01:36,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.9591836734693877) internal successors, (290), 97 states have internal predecessors, (290), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 327 transitions. [2021-08-30 17:01:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-08-30 17:01:36,257 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:36,258 INFO L513 BasicCegarLoop]: trace histogram [62, 62, 62, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:36,286 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-08-30 17:01:36,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:36,479 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting fooErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1112823532, now seen corresponding path program 3 times [2021-08-30 17:01:36,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:36,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384678183] [2021-08-30 17:01:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:36,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:38,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5737 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:01:38,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:38,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384678183] [2021-08-30 17:01:38,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384678183] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:38,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994730096] [2021-08-30 17:01:38,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:01:38,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:38,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:38,225 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-08-30 17:01:38,226 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-08-30 17:01:38,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-30 17:01:38,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:01:38,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 17:01:38,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:38,376 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-30 17:01:38,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2021-08-30 17:01:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5737 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2021-08-30 17:01:40,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:01:40,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994730096] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:01:40,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:01:40,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [67] total 71 [2021-08-30 17:01:40,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099261369] [2021-08-30 17:01:40,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:01:40,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:01:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2099, Invalid=2871, Unknown=0, NotChecked=0, Total=4970 [2021-08-30 17:01:40,117 INFO L87 Difference]: Start difference. First operand 297 states and 327 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:01:40,159 INFO L93 Difference]: Finished difference Result 296 states and 297 transitions. [2021-08-30 17:01:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:01:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 203 [2021-08-30 17:01:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:01:40,167 INFO L225 Difference]: With dead ends: 296 [2021-08-30 17:01:40,167 INFO L226 Difference]: Without dead ends: 296 [2021-08-30 17:01:40,169 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1574.56ms TimeCoverageRelationStatistics Valid=2099, Invalid=2871, Unknown=0, NotChecked=0, Total=4970 [2021-08-30 17:01:40,169 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.55ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.54ms IncrementalHoareTripleChecker+Time [2021-08-30 17:01:40,169 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 72 Unknown, 0 Unchecked, 0.55ms Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 38.54ms Time] [2021-08-30 17:01:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-08-30 17:01:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-08-30 17:01:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 290 states have (on average 1.006896551724138) internal successors, (292), 290 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:01:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2021-08-30 17:01:40,177 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 203 [2021-08-30 17:01:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:01:40,177 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2021-08-30 17:01:40,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:01:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2021-08-30 17:01:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-08-30 17:01:40,182 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:01:40,182 INFO L513 BasicCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:01:40,206 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-08-30 17:01:40,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:40,397 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:01:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:01:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash -568753049, now seen corresponding path program 1 times [2021-08-30 17:01:40,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:01:40,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485914845] [2021-08-30 17:01:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:40,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:01:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:40,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:01:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:40,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 17:01:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2021-08-30 17:01:41,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:01:41,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485914845] [2021-08-30 17:01:41,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485914845] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:01:41,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564217284] [2021-08-30 17:01:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:01:41,178 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:01:41,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:01:41,179 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-08-30 17:01:41,204 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-08-30 17:01:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:01:41,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 65 conjunts are in the unsatisfiable core [2021-08-30 17:01:41,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:01:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2021-08-30 17:01:43,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:01:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2021-08-30 17:01:49,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564217284] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:01:49,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:01:49,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 66, 67] total 165 [2021-08-30 17:01:49,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135234465] [2021-08-30 17:01:49,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2021-08-30 17:01:49,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:01:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2021-08-30 17:01:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10936, Invalid=16124, Unknown=0, NotChecked=0, Total=27060 [2021-08-30 17:01:49,151 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand has 165 states, 165 states have (on average 3.036363636363636) internal successors, (501), 163 states have internal predecessors, (501), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:02:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:02:04,498 INFO L93 Difference]: Finished difference Result 894 states and 957 transitions. [2021-08-30 17:02:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2021-08-30 17:02:04,499 INFO L78 Accepts]: Start accepts. Automaton has has 165 states, 165 states have (on average 3.036363636363636) internal successors, (501), 163 states have internal predecessors, (501), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 295 [2021-08-30 17:02:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:02:04,502 INFO L225 Difference]: With dead ends: 894 [2021-08-30 17:02:04,502 INFO L226 Difference]: Without dead ends: 894 [2021-08-30 17:02:04,509 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26456 ImplicationChecksByTransitivity, 16038.85ms TimeCoverageRelationStatistics Valid=28550, Invalid=59956, Unknown=0, NotChecked=0, Total=88506 [2021-08-30 17:02:04,509 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 3027 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 1215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1359.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.41ms SdHoareTripleChecker+Time, 1215 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1763.45ms IncrementalHoareTripleChecker+Time [2021-08-30 17:02:04,510 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3090 Valid, 19 Invalid, 2340 Unknown, 0 Unchecked, 19.41ms Time], IncrementalHoareTripleChecker [1215 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1763.45ms Time] [2021-08-30 17:02:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2021-08-30 17:02:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 584. [2021-08-30 17:02:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 578 states have (on average 1.0034602076124568) internal successors, (580), 578 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:02:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 585 transitions. [2021-08-30 17:02:04,526 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 585 transitions. Word has length 295 [2021-08-30 17:02:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:02:04,527 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 585 transitions. [2021-08-30 17:02:04,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 165 states, 165 states have (on average 3.036363636363636) internal successors, (501), 163 states have internal predecessors, (501), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:02:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 585 transitions. [2021-08-30 17:02:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2021-08-30 17:02:04,537 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:02:04,537 INFO L513 BasicCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:02:04,574 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-08-30 17:02:04,764 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,SelfDestructingSolverStorable12 [2021-08-30 17:02:04,764 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:02:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:02:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1736151143, now seen corresponding path program 2 times [2021-08-30 17:02:04,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:02:04,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280468474] [2021-08-30 17:02:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:02:04,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:02:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:02:05,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:02:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:02:05,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 17:02:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:02:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 23751 trivial. 0 not checked. [2021-08-30 17:02:06,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:02:06,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280468474] [2021-08-30 17:02:06,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280468474] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:02:06,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499244066] [2021-08-30 17:02:06,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:02:06,933 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:02:06,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:02:06,934 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-08-30 17:02:06,935 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-08-30 17:02:07,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:02:07,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:02:07,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 129 conjunts are in the unsatisfiable core [2021-08-30 17:02:07,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:02:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2021-08-30 17:02:14,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:02:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2021-08-30 17:02:28,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499244066] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:02:28,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:02:28,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 130, 131] total 325 [2021-08-30 17:02:28,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026520701] [2021-08-30 17:02:28,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 325 states [2021-08-30 17:02:28,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:02:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 325 interpolants. [2021-08-30 17:02:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35493, Invalid=69807, Unknown=0, NotChecked=0, Total=105300 [2021-08-30 17:02:28,110 INFO L87 Difference]: Start difference. First operand 584 states and 585 transitions. Second operand has 325 states, 325 states have (on average 3.0184615384615383) internal successors, (981), 323 states have internal predecessors, (981), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:02:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:02:48,726 INFO L93 Difference]: Finished difference Result 782 states and 783 transitions. [2021-08-30 17:02:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2021-08-30 17:02:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 325 states, 325 states have (on average 3.0184615384615383) internal successors, (981), 323 states have internal predecessors, (981), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 583 [2021-08-30 17:02:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:02:48,733 INFO L225 Difference]: With dead ends: 782 [2021-08-30 17:02:48,733 INFO L226 Difference]: Without dead ends: 782 [2021-08-30 17:02:48,743 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1499 GetRequests, 1041 SyntacticMatches, 0 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80936 ImplicationChecksByTransitivity, 26128.26ms TimeCoverageRelationStatistics Valid=63596, Invalid=147544, Unknown=0, NotChecked=0, Total=211140 [2021-08-30 17:02:48,744 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 2960 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 1443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1487.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2961 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.00ms SdHoareTripleChecker+Time, 1443 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1863.44ms IncrementalHoareTripleChecker+Time [2021-08-30 17:02:48,744 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2961 Valid, 26 Invalid, 3056 Unknown, 0 Unchecked, 26.00ms Time], IncrementalHoareTripleChecker [1443 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1863.44ms Time] [2021-08-30 17:02:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-08-30 17:02:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2021-08-30 17:02:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 776 states have (on average 1.0025773195876289) internal successors, (778), 776 states have internal predecessors, (778), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:02:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 783 transitions. [2021-08-30 17:02:48,758 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 783 transitions. Word has length 583 [2021-08-30 17:02:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:02:48,759 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 783 transitions. [2021-08-30 17:02:48,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 325 states, 325 states have (on average 3.0184615384615383) internal successors, (981), 323 states have internal predecessors, (981), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:02:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 783 transitions. [2021-08-30 17:02:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2021-08-30 17:02:48,777 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:02:48,778 INFO L513 BasicCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:02:48,807 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-08-30 17:02:48,992 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,SelfDestructingSolverStorable13 [2021-08-30 17:02:48,993 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 16 more)] === [2021-08-30 17:02:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:02:48,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2092834823, now seen corresponding path program 3 times [2021-08-30 17:02:48,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:02:48,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903914354] [2021-08-30 17:02:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:02:48,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:02:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:02:49,379 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 17:02:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:02:50,126 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 17:02:50,127 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 17:02:50,128 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr3REQUIRES_VIOLATION (20 of 21 remaining) [2021-08-30 17:02:50,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (19 of 21 remaining) [2021-08-30 17:02:50,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (18 of 21 remaining) [2021-08-30 17:02:50,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION (17 of 21 remaining) [2021-08-30 17:02:50,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE (16 of 21 remaining) [2021-08-30 17:02:50,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5ASSERT_VIOLATIONMEMORY_FREE (15 of 21 remaining) [2021-08-30 17:02:50,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6ASSERT_VIOLATIONMEMORY_FREE (14 of 21 remaining) [2021-08-30 17:02:50,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7ASSERT_VIOLATIONMEMORY_FREE (13 of 21 remaining) [2021-08-30 17:02:50,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2021-08-30 17:02:50,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2021-08-30 17:02:50,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2021-08-30 17:02:50,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2021-08-30 17:02:50,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2021-08-30 17:02:50,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2021-08-30 17:02:50,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2021-08-30 17:02:50,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2021-08-30 17:02:50,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16ENSURES_VIOLATIONMEMORY_LEAK (4 of 21 remaining) [2021-08-30 17:02:50,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0REQUIRES_VIOLATION (3 of 21 remaining) [2021-08-30 17:02:50,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr1REQUIRES_VIOLATION (2 of 21 remaining) [2021-08-30 17:02:50,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr2REQUIRES_VIOLATION (1 of 21 remaining) [2021-08-30 17:02:50,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr3REQUIRES_VIOLATION (0 of 21 remaining) [2021-08-30 17:02:50,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-30 17:02:50,141 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 17:02:50,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 05:02:50 BoogieIcfgContainer [2021-08-30 17:02:50,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 17:02:50,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 17:02:50,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 17:02:50,380 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 17:02:50,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:01:17" (3/4) ... [2021-08-30 17:02:50,382 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-30 17:02:50,578 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-30 17:02:50,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 17:02:50,579 INFO L158 Benchmark]: Toolchain (without parser) took 94397.11ms. Allocated memory was 56.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 34.4MB in the beginning and 588.2MB in the end (delta: -553.8MB). Peak memory consumption was 686.3MB. Max. memory is 16.1GB. [2021-08-30 17:02:50,579 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 56.6MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:02:50,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.40ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 34.1MB in the end (delta: 215.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-30 17:02:50,580 INFO L158 Benchmark]: Boogie Preprocessor took 63.35ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 31.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-30 17:02:50,581 INFO L158 Benchmark]: RCFGBuilder took 535.25ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 31.5MB in the beginning and 40.7MB in the end (delta: -9.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2021-08-30 17:02:50,581 INFO L158 Benchmark]: TraceAbstraction took 93228.64ms. Allocated memory was 71.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 40.2MB in the beginning and 635.4MB in the end (delta: -595.3MB). Peak memory consumption was 628.5MB. Max. memory is 16.1GB. [2021-08-30 17:02:50,581 INFO L158 Benchmark]: Witness Printer took 198.75ms. Allocated memory is still 1.3GB. Free memory was 635.4MB in the beginning and 588.2MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2021-08-30 17:02:50,583 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.37ms. Allocated memory is still 56.6MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.40ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 34.1MB in the end (delta: 215.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.35ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 31.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 535.25ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 31.5MB in the beginning and 40.7MB in the end (delta: -9.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 93228.64ms. Allocated memory was 71.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 40.2MB in the beginning and 635.4MB in the end (delta: -595.3MB). Peak memory consumption was 628.5MB. Max. memory is 16.1GB. * Witness Printer took 198.75ms. Allocated memory is still 1.3GB. Free memory was 635.4MB in the beginning and 588.2MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 540]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [\old(a)=516, \old(a)=521, \old(b)=518, \old(b)=519, \old(n)=514, a={0:0}, b={0:0}, n=0] [L535] n = 128 [L536] a = malloc (n * sizeof(*a)) [L537] b = malloc (n * sizeof(*b)) [L538] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, b++={-3:0}, n=128] [L538] *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, b++={-3:0}, n=128] [L539] CALL foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, n=128] [L527] int i; [L528] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=0, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=0, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=0, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=1, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=1, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=1, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=2, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=2, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=2, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=3, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=3, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=3, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=4, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=4, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=4, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=5, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=5, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=5, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=6, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=6, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=6, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=7, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=7, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=7, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=8, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=8, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=8, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=9, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=9, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=9, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=10, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=10, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=10, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=11, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=11, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=11, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=12, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=12, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=12, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=13, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=13, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=13, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=14, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=14, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=14, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=15, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=15, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=15, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=16, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=16, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=16, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=17, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=17, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=17, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=18, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=18, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=18, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=19, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=19, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=19, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=20, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=20, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=20, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=21, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=21, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=21, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=22, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=22, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=22, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=23, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=23, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=23, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=24, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=24, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=24, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=25, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=25, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=25, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=26, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=26, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=26, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=27, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=27, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=27, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=28, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=28, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=28, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=29, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=29, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=29, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=30, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=30, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=30, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=31, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=31, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=31, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=32, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=32, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=32, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=33, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=33, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=33, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=34, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=34, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=34, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=35, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=35, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=35, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=36, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=36, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=36, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=37, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=37, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=37, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=38, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=38, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=38, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=39, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=39, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=39, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=40, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=40, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=40, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=41, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=41, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=41, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=42, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=42, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=42, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=43, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=43, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=43, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=44, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=44, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=44, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=45, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=45, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=45, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=46, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=46, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=46, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=47, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=47, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=47, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=48, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=48, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=48, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=49, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=49, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=49, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=50, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=50, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=50, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=51, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=51, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=51, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=52, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=52, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=52, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=53, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=53, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=53, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=54, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=54, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=54, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=55, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=55, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=55, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=56, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=56, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=56, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=57, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=57, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=57, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=58, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=58, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=58, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=59, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=59, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=59, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=60, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=60, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=60, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=61, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=61, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=61, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=62, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=62, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=62, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=63, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=63, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=63, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=64, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=64, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=64, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=65, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=65, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=65, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=66, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=66, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=66, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=67, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=67, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=67, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=68, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=68, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=68, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=69, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=69, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=69, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=70, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=70, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=70, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=71, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=71, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=71, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=72, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=72, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=72, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=73, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=73, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=73, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=74, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=74, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=74, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=75, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=75, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=75, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=76, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=76, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=76, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=77, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=77, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=77, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=78, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=78, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=78, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=79, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=79, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=79, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=80, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=80, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=80, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=81, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=81, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=81, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=82, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=82, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=82, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=83, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=83, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=83, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=84, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=84, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=84, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=85, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=85, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=85, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=86, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=86, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=86, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=87, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=87, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=87, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=88, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=88, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=88, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=89, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=89, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=89, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=90, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=90, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=90, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=91, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=91, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=91, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=92, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=92, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=92, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=93, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=93, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=93, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=94, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=94, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=94, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=95, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=95, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=95, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=96, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=96, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=96, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=97, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=97, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=97, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=98, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=98, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=98, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=99, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=99, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=99, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=100, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=100, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=100, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=101, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=101, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=101, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=102, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=102, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=102, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=103, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=103, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=103, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=104, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=104, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=104, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=105, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=105, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=105, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=106, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=106, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=106, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=107, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=107, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=107, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=108, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=108, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=108, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=109, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=109, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=109, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=110, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=110, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=110, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=111, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=111, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=111, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=112, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=112, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=112, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=113, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=113, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=113, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=114, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=114, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=114, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=115, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=115, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=115, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=116, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=116, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=116, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=117, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=117, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=117, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=118, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=118, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=118, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=119, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=119, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=119, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=120, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=120, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=120, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=121, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=121, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=121, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=122, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=122, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=122, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=123, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=123, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=123, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=124, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=124, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=124, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=125, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=125, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=125, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=126, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=126, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=126, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=127, n=128] [L528] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=127, n=128] [L529] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=127, n=128] [L528] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=128, n=128] [L528] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=128, n=128] [L530] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=0, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=0, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=0, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=1, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=1, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=1, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=2, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=2, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=2, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=3, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=3, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=3, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=4, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=4, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=4, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=5, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=5, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=5, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=6, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=6, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=6, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=7, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=7, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=7, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=8, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=8, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=8, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=9, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=9, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=9, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=10, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=10, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=10, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=11, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=11, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=11, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=12, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=12, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=12, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=13, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=13, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=13, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=14, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=14, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=14, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=15, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=15, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=15, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=16, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=16, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=16, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=17, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=17, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=17, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=18, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=18, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=18, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=19, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=19, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=19, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=20, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=20, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=20, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=21, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=21, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=21, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=22, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=22, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=22, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=23, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=23, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=23, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=24, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=24, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=24, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=25, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=25, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=25, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=26, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=26, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=26, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=27, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=27, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=27, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=28, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=28, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=28, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=29, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=29, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=29, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=30, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=30, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=30, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=31, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=31, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=31, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=32, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=32, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=32, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=33, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=33, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=33, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=34, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=34, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=34, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=35, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=35, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=35, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=36, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=36, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=36, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=37, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=37, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=37, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=38, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=38, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=38, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=39, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=39, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=39, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=40, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=40, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=40, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=41, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=41, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=41, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=42, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=42, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=42, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=43, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=43, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=43, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=44, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=44, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=44, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=45, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=45, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=45, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=46, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=46, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=46, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=47, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=47, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=47, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=48, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=48, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=48, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=49, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=49, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=49, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=50, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=50, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=50, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=51, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=51, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=51, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=52, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=52, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=52, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=53, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=53, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=53, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=54, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=54, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=54, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=55, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=55, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=55, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=56, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=56, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=56, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=57, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=57, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=57, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=58, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=58, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=58, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=59, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=59, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=59, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=60, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=60, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=60, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=61, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=61, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=61, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=62, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=62, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=62, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=63, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=63, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=63, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=64, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=64, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=64, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=65, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=65, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=65, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=66, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=66, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=66, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=67, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=67, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=67, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=68, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=68, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=68, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=69, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=69, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=69, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=70, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=70, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=70, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=71, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=71, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=71, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=72, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=72, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=72, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=73, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=73, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=73, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=74, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=74, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=74, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=75, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=75, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=75, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=76, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=76, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=76, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=77, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=77, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=77, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=78, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=78, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=78, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=79, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=79, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=79, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=80, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=80, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=80, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=81, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=81, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=81, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=82, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=82, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=82, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=83, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=83, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=83, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=84, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=84, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=84, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=85, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=85, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=85, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=86, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=86, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=86, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=87, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=87, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=87, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=88, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=88, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=88, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=89, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=89, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=89, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=90, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=90, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=90, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=91, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=91, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=91, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=92, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=92, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=92, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=93, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=93, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=93, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=94, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=94, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=94, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=95, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=95, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=95, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=96, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=96, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=96, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=97, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=97, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=97, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=98, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=98, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=98, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=99, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=99, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=99, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=100, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=100, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=100, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=101, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=101, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=101, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=102, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=102, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=102, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=103, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=103, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=103, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=104, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=104, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=104, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=105, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=105, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=105, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=106, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=106, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=106, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=107, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=107, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=107, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=108, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=108, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=108, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=109, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=109, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=109, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=110, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=110, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=110, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=111, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=111, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=111, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=112, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=112, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=112, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=113, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=113, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=113, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=114, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=114, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=114, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=115, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=115, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=115, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=116, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=116, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=116, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=117, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=117, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=117, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=118, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=118, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=118, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=119, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=119, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=119, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=120, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=120, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=120, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=121, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=121, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=121, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=122, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=122, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=122, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=123, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=123, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=123, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=124, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=124, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=124, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=125, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=125, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=125, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=126, n=128] [L530] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=126, n=128] [L531] b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=126, n=128] [L530] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=127, n=128] [L530] COND FALSE !(i < 128 - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, i=127, n=128] [L539] RET foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={-2:0}, b={-3:4}, n=128] [L540] b[-2] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 77 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 92924.95ms, OverallIterations: 15, TraceHistogramMax: 128, EmptinessCheckTime: 59.92ms, AutomataDifference: 45233.88ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 11.26ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9830 SdHoareTripleChecker+Valid, 6563.07ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9702 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 5215.15ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 712 mSDsCounter, 3749 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5835 IncrementalHoareTripleChecker+Invalid, 9584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3749 mSolverCounterUnsat, 61 mSDtfsCounter, 5835 mSolverCounterSat, 92.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3439 GetRequests, 2252 SyntacticMatches, 0 SemanticMatches, 1187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118204 ImplicationChecksByTransitivity, 52818.22ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=782occurred in iteration=14, InterpolantAutomatonStates: 457, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 136.66ms AutomataMinimizationTime, 14 MinimizatonAttempts, 702 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 213.92ms SsaConstructionTime, 1249.67ms SatisfiabilityAnalysisTime, 42384.67ms InterpolantComputationTime, 3599 NumberOfCodeBlocks, 3374 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3903 ConstructedInterpolants, 0 QuantifiedInterpolants, 22714 SizeOfPredicates, 22 NumberOfNonLiveVariables, 4067 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 50311/127716 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-08-30 17:02:50,653 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...