./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9af739900018493f70ca6be86d814e194413d937 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:41:11,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 17:41:11,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 17:41:11,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 17:41:11,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 17:41:11,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 17:41:11,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 17:41:11,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 17:41:11,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 17:41:11,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 17:41:11,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 17:41:11,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 17:41:11,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 17:41:11,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 17:41:11,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 17:41:11,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 17:41:11,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 17:41:11,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 17:41:11,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 17:41:11,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 17:41:11,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 17:41:11,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 17:41:11,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 17:41:11,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 17:41:11,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 17:41:11,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 17:41:11,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 17:41:11,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 17:41:11,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 17:41:11,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 17:41:11,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 17:41:11,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 17:41:11,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 17:41:11,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 17:41:11,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 17:41:11,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 17:41:11,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 17:41:11,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 17:41:11,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 17:41:11,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 17:41:11,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 17:41:11,830 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:41:11,870 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 17:41:11,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 17:41:11,872 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 17:41:11,872 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 17:41:11,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 17:41:11,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 17:41:11,874 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 17:41:11,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 17:41:11,874 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 17:41:11,875 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 17:41:11,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 17:41:11,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 17:41:11,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 17:41:11,876 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 17:41:11,876 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 17:41:11,876 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 17:41:11,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 17:41:11,877 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 17:41:11,877 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 17:41:11,877 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 17:41:11,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 17:41:11,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 17:41:11,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 17:41:11,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:41:11,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 17:41:11,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 17:41:11,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 17:41:11,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 17:41:11,878 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 17:41:11,879 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 -> 9af739900018493f70ca6be86d814e194413d937 [2021-08-30 17:41:12,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 17:41:12,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 17:41:12,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 17:41:12,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 17:41:12,225 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 17:41:12,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2021-08-30 17:41:12,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf31d772a/b44090fee87e4fec8763fc597101539f/FLAG2c7fd063c [2021-08-30 17:41:12,736 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 17:41:12,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-read.c [2021-08-30 17:41:12,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf31d772a/b44090fee87e4fec8763fc597101539f/FLAG2c7fd063c [2021-08-30 17:41:13,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf31d772a/b44090fee87e4fec8763fc597101539f [2021-08-30 17:41:13,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 17:41:13,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 17:41:13,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 17:41:13,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 17:41:13,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 17:41:13,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e28943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13, skipping insertion in model container [2021-08-30 17:41:13,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 17:41:13,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:41:13,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:41:13,294 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 17:41:13,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:41:13,318 INFO L208 MainTranslator]: Completed translation [2021-08-30 17:41:13,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13 WrapperNode [2021-08-30 17:41:13,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 17:41:13,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 17:41:13,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 17:41:13,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 17:41:13,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 17:41:13,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 17:41:13,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 17:41:13,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 17:41:13,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (1/1) ... [2021-08-30 17:41:13,409 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:41:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:13,434 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:41:13,460 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:41:13,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 17:41:13,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 17:41:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-08-30 17:41:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 17:41:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-08-30 17:41:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-30 17:41:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 17:41:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 17:41:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-30 17:41:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 17:41:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 17:41:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 17:41:13,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 17:41:13,649 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-08-30 17:41:13,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:41:13 BoogieIcfgContainer [2021-08-30 17:41:13,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 17:41:13,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 17:41:13,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 17:41:13,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 17:41:13,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:41:13" (1/3) ... [2021-08-30 17:41:13,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f1b1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:41:13, skipping insertion in model container [2021-08-30 17:41:13,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:41:13" (2/3) ... [2021-08-30 17:41:13,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f1b1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:41:13, skipping insertion in model container [2021-08-30 17:41:13,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:41:13" (3/3) ... [2021-08-30 17:41:13,661 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-read.c [2021-08-30 17:41:13,665 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 17:41:13,665 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-08-30 17:41:13,710 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 17:41:13,718 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:41:13,718 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-30 17:41:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 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:41:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 17:41:13,743 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:13,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:13,745 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2021-08-30 17:41:13,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:13,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567368025] [2021-08-30 17:41:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:13,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,008 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:41:14,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:14,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567368025] [2021-08-30 17:41:14,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567368025] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:14,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:41:14,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:41:14,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876139551] [2021-08-30 17:41:14,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:41:14,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:14,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:41:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:41:14,071 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 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, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:41:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:14,275 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2021-08-30 17:41:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:41:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2021-08-30 17:41:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:14,284 INFO L225 Difference]: With dead ends: 58 [2021-08-30 17:41:14,291 INFO L226 Difference]: Without dead ends: 54 [2021-08-30 17:41:14,292 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.99ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:41:14,295 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.83ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 153.95ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:14,296 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 14 Invalid, 106 Unknown, 0 Unchecked, 2.83ms Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 153.95ms Time] [2021-08-30 17:41:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-30 17:41:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2021-08-30 17:41:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 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:41:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-08-30 17:41:14,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2021-08-30 17:41:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:14,327 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-08-30 17:41:14,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:41:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-08-30 17:41:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-30 17:41:14,328 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:14,328 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:14,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 17:41:14,329 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:14,330 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2021-08-30 17:41:14,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:14,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405588978] [2021-08-30 17:41:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:14,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,369 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:41:14,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:14,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405588978] [2021-08-30 17:41:14,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405588978] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:14,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:41:14,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:41:14,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782362508] [2021-08-30 17:41:14,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:41:14,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:41:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:41:14,373 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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:41:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:14,460 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-08-30 17:41:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:41:14,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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 11 [2021-08-30 17:41:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:14,463 INFO L225 Difference]: With dead ends: 49 [2021-08-30 17:41:14,463 INFO L226 Difference]: Without dead ends: 49 [2021-08-30 17:41:14,463 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.68ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:41:14,465 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.25ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.95ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:14,465 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 11 Invalid, 96 Unknown, 0 Unchecked, 2.25ms Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 70.95ms Time] [2021-08-30 17:41:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-08-30 17:41:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2021-08-30 17:41:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 35 states have internal predecessors, (40), 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:41:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2021-08-30 17:41:14,471 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2021-08-30 17:41:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:14,471 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-08-30 17:41:14,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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:41:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2021-08-30 17:41:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 17:41:14,472 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:14,472 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:14,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 17:41:14,473 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:14,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2021-08-30 17:41:14,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:14,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55514259] [2021-08-30 17:41:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:14,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,528 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:41:14,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:14,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55514259] [2021-08-30 17:41:14,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55514259] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:14,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:41:14,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 17:41:14,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711124280] [2021-08-30 17:41:14,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:41:14,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:41:14,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:41:14,541 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 5 states have (on average 1.6) 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:41:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:14,654 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-08-30 17:41:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:41:14,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) 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:41:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:14,656 INFO L225 Difference]: With dead ends: 40 [2021-08-30 17:41:14,656 INFO L226 Difference]: Without dead ends: 40 [2021-08-30 17:41:14,656 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.58ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:41:14,657 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.75ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.25ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:14,658 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 14 Invalid, 127 Unknown, 0 Unchecked, 1.75ms Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 88.25ms Time] [2021-08-30 17:41:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-30 17:41:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-30 17:41:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 34 states have internal predecessors, (39), 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:41:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-08-30 17:41:14,670 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2021-08-30 17:41:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:14,670 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-08-30 17:41:14,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) 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:41:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-08-30 17:41:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 17:41:14,671 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:14,671 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:14,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-30 17:41:14,671 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2021-08-30 17:41:14,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:14,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576626682] [2021-08-30 17:41:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:14,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,752 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:41:14,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:14,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576626682] [2021-08-30 17:41:14,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576626682] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:14,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:41:14,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 17:41:14,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294953182] [2021-08-30 17:41:14,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:41:14,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:14,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:41:14,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:41:14,755 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.6) 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:41:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:14,894 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-08-30 17:41:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:41:14,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) 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:41:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:14,896 INFO L225 Difference]: With dead ends: 46 [2021-08-30 17:41:14,896 INFO L226 Difference]: Without dead ends: 46 [2021-08-30 17:41:14,897 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.10ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:41:14,905 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.16ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 106.24ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:14,907 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 139 Unknown, 0 Unchecked, 3.16ms Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 106.24ms Time] [2021-08-30 17:41:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-30 17:41:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2021-08-30 17:41:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 35 states have internal predecessors, (40), 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:41:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2021-08-30 17:41:14,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2021-08-30 17:41:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:14,918 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-08-30 17:41:14,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) 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:41:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2021-08-30 17:41:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 17:41:14,920 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:14,920 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:14,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-30 17:41:14,920 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2021-08-30 17:41:14,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:14,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018799743] [2021-08-30 17:41:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:14,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:15,027 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:41:15,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:15,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018799743] [2021-08-30 17:41:15,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018799743] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:15,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:41:15,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-30 17:41:15,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153606148] [2021-08-30 17:41:15,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:41:15,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:15,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:41:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:41:15,030 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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:41:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:15,159 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-08-30 17:41:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:41:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2021-08-30 17:41:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:15,162 INFO L225 Difference]: With dead ends: 61 [2021-08-30 17:41:15,162 INFO L226 Difference]: Without dead ends: 61 [2021-08-30 17:41:15,163 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.36ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:41:15,170 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.96ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.70ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:15,171 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 169 Unknown, 0 Unchecked, 1.96ms Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 100.70ms Time] [2021-08-30 17:41:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-30 17:41:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2021-08-30 17:41:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 39 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:41:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2021-08-30 17:41:15,182 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 15 [2021-08-30 17:41:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:15,182 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2021-08-30 17:41:15,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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:41:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-08-30 17:41:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 17:41:15,186 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:15,186 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:15,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-30 17:41:15,187 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2021-08-30 17:41:15,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:15,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211470197] [2021-08-30 17:41:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:15,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:15,271 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:41:15,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:15,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211470197] [2021-08-30 17:41:15,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211470197] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:15,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885347621] [2021-08-30 17:41:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:15,272 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:15,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:15,284 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:41:15,308 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:41:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:15,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-30 17:41:15,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:15,445 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:41:15,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:15,571 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:41:15,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885347621] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:15,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:15,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2021-08-30 17:41:15,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119248165] [2021-08-30 17:41:15,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 17:41:15,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 17:41:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-30 17:41:15,573 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:41:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:15,775 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-08-30 17:41:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:41:15,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-30 17:41:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:15,779 INFO L225 Difference]: With dead ends: 70 [2021-08-30 17:41:15,779 INFO L226 Difference]: Without dead ends: 70 [2021-08-30 17:41:15,780 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.88ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-08-30 17:41:15,781 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.30ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 138.49ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:15,781 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 31 Invalid, 207 Unknown, 0 Unchecked, 2.30ms Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 138.49ms Time] [2021-08-30 17:41:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-30 17:41:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2021-08-30 17:41:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:41:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-08-30 17:41:15,802 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2021-08-30 17:41:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:15,802 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-08-30 17:41:15,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:41:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-08-30 17:41:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-30 17:41:15,803 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:15,803 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:15,823 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:41:16,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-30 17:41:16,004 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1213405753, now seen corresponding path program 1 times [2021-08-30 17:41:16,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:16,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283955550] [2021-08-30 17:41:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:16,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:16,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:41:16,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:16,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283955550] [2021-08-30 17:41:16,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283955550] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:16,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663255531] [2021-08-30 17:41:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:16,132 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:16,137 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:41:16,138 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:41:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:16,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-30 17:41:16,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:16,243 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:41:16,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:41:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:41:16,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:41:16,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663255531] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:16,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:16,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2021-08-30 17:41:16,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492022233] [2021-08-30 17:41:16,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-30 17:41:16,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:16,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-30 17:41:16,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-30 17:41:16,479 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 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:41:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:16,747 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2021-08-30 17:41:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 17:41:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 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 17 [2021-08-30 17:41:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:16,748 INFO L225 Difference]: With dead ends: 69 [2021-08-30 17:41:16,748 INFO L226 Difference]: Without dead ends: 69 [2021-08-30 17:41:16,749 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 163.90ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-08-30 17:41:16,749 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 145 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 139.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.79ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.89ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:16,750 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 26 Invalid, 308 Unknown, 0 Unchecked, 2.79ms Time], IncrementalHoareTripleChecker [17 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 170.89ms Time] [2021-08-30 17:41:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-30 17:41:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2021-08-30 17:41:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:41:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2021-08-30 17:41:16,755 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 17 [2021-08-30 17:41:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:16,756 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2021-08-30 17:41:16,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 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:41:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2021-08-30 17:41:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 17:41:16,757 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:16,757 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:16,785 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:41:16,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-08-30 17:41:16,977 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2021-08-30 17:41:16,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:16,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759172684] [2021-08-30 17:41:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:16,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:17,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:41:17,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:17,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759172684] [2021-08-30 17:41:17,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759172684] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:17,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549889878] [2021-08-30 17:41:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:17,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:17,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:17,054 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:41:17,061 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:41:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:17,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-30 17:41:17,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:41:17,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:41:17,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549889878] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:17,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:17,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2021-08-30 17:41:17,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405486274] [2021-08-30 17:41:17,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-30 17:41:17,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-30 17:41:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-30 17:41:17,306 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:17,506 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2021-08-30 17:41:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-30 17:41:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2021-08-30 17:41:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:17,507 INFO L225 Difference]: With dead ends: 77 [2021-08-30 17:41:17,507 INFO L226 Difference]: Without dead ends: 71 [2021-08-30 17:41:17,507 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 123.42ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-08-30 17:41:17,508 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 85 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 127.98ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:17,508 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 35 Invalid, 266 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [15 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 127.98ms Time] [2021-08-30 17:41:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-08-30 17:41:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 56. [2021-08-30 17:41:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 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:41:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-08-30 17:41:17,511 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 20 [2021-08-30 17:41:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:17,511 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-08-30 17:41:17,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-08-30 17:41:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-30 17:41:17,516 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:17,516 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:17,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-30 17:41:17,728 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:41:17,729 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash -523456178, now seen corresponding path program 2 times [2021-08-30 17:41:17,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:17,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959558759] [2021-08-30 17:41:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:17,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:41:17,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:17,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959558759] [2021-08-30 17:41:17,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959558759] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:17,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368457768] [2021-08-30 17:41:17,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:41:17,816 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:17,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:17,817 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:41:17,868 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:41:17,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 17:41:17,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:17,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 17:41:17,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:17,911 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:41:17,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-08-30 17:41:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:41:18,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:41:18,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368457768] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:18,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:41:18,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2021-08-30 17:41:18,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766017662] [2021-08-30 17:41:18,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:41:18,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:41:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:41:18,361 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:41:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:18,374 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2021-08-30 17:41:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:41:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-08-30 17:41:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:18,375 INFO L225 Difference]: With dead ends: 86 [2021-08-30 17:41:18,376 INFO L226 Difference]: Without dead ends: 86 [2021-08-30 17:41:18,376 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 58.00ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:41:18,376 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.26ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 11.57ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:18,377 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 55 Unknown, 0 Unchecked, 0.26ms Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 36 Unchecked, 11.57ms Time] [2021-08-30 17:41:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-08-30 17:41:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-08-30 17:41:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.25) internal successors, (90), 78 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2021-08-30 17:41:18,381 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 25 [2021-08-30 17:41:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:18,381 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2021-08-30 17:41:18,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:41:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2021-08-30 17:41:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-30 17:41:18,387 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:18,388 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:18,410 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:41:18,597 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:41:18,598 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -523456177, now seen corresponding path program 1 times [2021-08-30 17:41:18,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:18,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177033462] [2021-08-30 17:41:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:18,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:41:18,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:18,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177033462] [2021-08-30 17:41:18,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177033462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:18,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:41:18,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:41:18,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747229709] [2021-08-30 17:41:18,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:41:18,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:41:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:41:18,667 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:41:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:18,736 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2021-08-30 17:41:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:41:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-08-30 17:41:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:18,738 INFO L225 Difference]: With dead ends: 88 [2021-08-30 17:41:18,738 INFO L226 Difference]: Without dead ends: 88 [2021-08-30 17:41:18,739 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.84ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:41:18,739 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.48ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:18,740 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 15 Invalid, 131 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 65.48ms Time] [2021-08-30 17:41:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-08-30 17:41:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2021-08-30 17:41:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 78 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2021-08-30 17:41:18,755 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 25 [2021-08-30 17:41:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:18,756 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2021-08-30 17:41:18,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:41:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2021-08-30 17:41:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-30 17:41:18,757 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:18,757 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:18,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-30 17:41:18,757 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:18,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2020089663, now seen corresponding path program 1 times [2021-08-30 17:41:18,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:18,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81680512] [2021-08-30 17:41:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:18,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:18,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:41:18,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:18,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81680512] [2021-08-30 17:41:18,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81680512] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:18,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961707713] [2021-08-30 17:41:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:18,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:18,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:18,797 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:41:18,841 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:41:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:18,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 17:41:18,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:41:18,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:41:18,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961707713] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:18,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:41:18,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-08-30 17:41:18,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546411230] [2021-08-30 17:41:18,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 17:41:18,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:18,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 17:41:18,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:41:18,905 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:41:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:18,940 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2021-08-30 17:41:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:41:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2021-08-30 17:41:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:18,941 INFO L225 Difference]: With dead ends: 84 [2021-08-30 17:41:18,941 INFO L226 Difference]: Without dead ends: 84 [2021-08-30 17:41:18,942 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.09ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:41:18,942 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.87ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.07ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:18,943 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 51 Unknown, 0 Unchecked, 0.87ms Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 32.07ms Time] [2021-08-30 17:41:18,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-08-30 17:41:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-08-30 17:41:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 76 states have internal predecessors, (87), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2021-08-30 17:41:18,946 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 31 [2021-08-30 17:41:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:18,946 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2021-08-30 17:41:18,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:41:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2021-08-30 17:41:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-30 17:41:18,947 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:18,947 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:18,973 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:41:19,170 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,SelfDestructingSolverStorable10 [2021-08-30 17:41:19,171 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:19,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:19,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2020089664, now seen corresponding path program 1 times [2021-08-30 17:41:19,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:19,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814260642] [2021-08-30 17:41:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:19,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:41:19,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:19,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814260642] [2021-08-30 17:41:19,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814260642] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:19,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216351077] [2021-08-30 17:41:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:19,222 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:19,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:19,237 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:41:19,238 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:41:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 17:41:19,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:41:19,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:41:19,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216351077] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:19,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:19,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-08-30 17:41:19,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230649712] [2021-08-30 17:41:19,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 17:41:19,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 17:41:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:41:19,386 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:41:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:19,497 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2021-08-30 17:41:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:41:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2021-08-30 17:41:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:19,500 INFO L225 Difference]: With dead ends: 127 [2021-08-30 17:41:19,500 INFO L226 Difference]: Without dead ends: 127 [2021-08-30 17:41:19,500 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 19.28ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:41:19,501 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.97ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.28ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:19,501 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 21 Invalid, 175 Unknown, 0 Unchecked, 0.97ms Time], IncrementalHoareTripleChecker [21 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 101.28ms Time] [2021-08-30 17:41:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-30 17:41:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2021-08-30 17:41:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 101 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2021-08-30 17:41:19,505 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 31 [2021-08-30 17:41:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:19,505 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2021-08-30 17:41:19,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:41:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2021-08-30 17:41:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-30 17:41:19,510 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:19,510 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:19,535 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:41:19,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:19,732 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1856317080, now seen corresponding path program 2 times [2021-08-30 17:41:19,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:19,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313231872] [2021-08-30 17:41:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:19,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-30 17:41:19,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:19,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313231872] [2021-08-30 17:41:19,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313231872] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:19,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:41:19,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-30 17:41:19,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800459578] [2021-08-30 17:41:19,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-30 17:41:19,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-30 17:41:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-30 17:41:19,803 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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:41:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:19,928 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2021-08-30 17:41:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 17:41:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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 31 [2021-08-30 17:41:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:19,930 INFO L225 Difference]: With dead ends: 103 [2021-08-30 17:41:19,930 INFO L226 Difference]: Without dead ends: 103 [2021-08-30 17:41:19,930 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 60.31ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-08-30 17:41:19,931 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.83ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.20ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:19,931 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 25 Invalid, 209 Unknown, 0 Unchecked, 1.83ms Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 88.20ms Time] [2021-08-30 17:41:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-30 17:41:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2021-08-30 17:41:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 89 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2021-08-30 17:41:19,935 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 31 [2021-08-30 17:41:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:19,935 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2021-08-30 17:41:19,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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:41:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2021-08-30 17:41:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-30 17:41:19,936 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:19,936 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:19,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-30 17:41:19,936 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1860847279, now seen corresponding path program 1 times [2021-08-30 17:41:19,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:19,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451089142] [2021-08-30 17:41:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:19,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:19,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:41:20,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:20,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451089142] [2021-08-30 17:41:20,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451089142] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:20,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102628402] [2021-08-30 17:41:20,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:20,014 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:20,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:20,017 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:41:20,040 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:41:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:20,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:41:20,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:41:20,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:41:20,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102628402] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:20,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:20,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2021-08-30 17:41:20,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119265079] [2021-08-30 17:41:20,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 17:41:20,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:20,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 17:41:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-08-30 17:41:20,417 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:41:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:20,701 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2021-08-30 17:41:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-30 17:41:20,702 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2021-08-30 17:41:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:20,703 INFO L225 Difference]: With dead ends: 106 [2021-08-30 17:41:20,703 INFO L226 Difference]: Without dead ends: 103 [2021-08-30 17:41:20,703 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 196.60ms TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-08-30 17:41:20,704 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 97 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 152.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.03ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 185.03ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:20,704 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 42 Invalid, 430 Unknown, 0 Unchecked, 2.03ms Time], IncrementalHoareTripleChecker [23 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 185.03ms Time] [2021-08-30 17:41:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-30 17:41:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2021-08-30 17:41:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.2) internal successors, (102), 89 states have internal predecessors, (102), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-08-30 17:41:20,708 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 46 [2021-08-30 17:41:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:20,708 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-08-30 17:41:20,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:41:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-08-30 17:41:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-30 17:41:20,712 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:20,712 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:20,738 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:41:20,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:20,925 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1743494932, now seen corresponding path program 2 times [2021-08-30 17:41:20,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:20,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239824669] [2021-08-30 17:41:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:20,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:20,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:41:21,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:21,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239824669] [2021-08-30 17:41:21,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239824669] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:21,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919770877] [2021-08-30 17:41:21,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:41:21,012 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:21,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:21,013 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:41:21,015 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:41:21,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:41:21,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:21,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:41:21,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:21,097 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:41:21,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-30 17:41:21,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-08-30 17:41:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:41:21,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:41:21,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919770877] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:21,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:41:21,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2021-08-30 17:41:21,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851557300] [2021-08-30 17:41:21,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:41:21,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:41:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:41:21,481 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:21,492 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2021-08-30 17:41:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:41:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2021-08-30 17:41:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:21,494 INFO L225 Difference]: With dead ends: 98 [2021-08-30 17:41:21,494 INFO L226 Difference]: Without dead ends: 98 [2021-08-30 17:41:21,494 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 84.29ms TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:41:21,495 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.20ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 8.73ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:21,495 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 63 Unknown, 0 Unchecked, 0.20ms Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 49 Unchecked, 8.73ms Time] [2021-08-30 17:41:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-30 17:41:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-08-30 17:41:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 88 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-08-30 17:41:21,498 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 51 [2021-08-30 17:41:21,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:21,499 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-08-30 17:41:21,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-08-30 17:41:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-30 17:41:21,500 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:21,500 INFO L513 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:21,528 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:41:21,716 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,SelfDestructingSolverStorable14 [2021-08-30 17:41:21,717 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1031120918, now seen corresponding path program 1 times [2021-08-30 17:41:21,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:21,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042226861] [2021-08-30 17:41:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:21,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 67 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-30 17:41:21,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:21,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042226861] [2021-08-30 17:41:21,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042226861] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:21,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923247293] [2021-08-30 17:41:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:21,798 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:21,799 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:41:21,800 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:41:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:21,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:41:21,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:41:22,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:41:22,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923247293] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:22,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:22,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2021-08-30 17:41:22,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166367452] [2021-08-30 17:41:22,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 17:41:22,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:22,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 17:41:22,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-08-30 17:41:22,170 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:22,427 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2021-08-30 17:41:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-30 17:41:22,428 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2021-08-30 17:41:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:22,429 INFO L225 Difference]: With dead ends: 126 [2021-08-30 17:41:22,429 INFO L226 Difference]: Without dead ends: 126 [2021-08-30 17:41:22,429 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 183.85ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-08-30 17:41:22,430 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 135.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.09ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 164.54ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:22,430 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 40 Invalid, 373 Unknown, 0 Unchecked, 2.09ms Time], IncrementalHoareTripleChecker [16 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 164.54ms Time] [2021-08-30 17:41:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-08-30 17:41:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2021-08-30 17:41:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.1346153846153846) internal successors, (118), 107 states have internal predecessors, (118), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2021-08-30 17:41:22,433 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 52 [2021-08-30 17:41:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:22,434 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2021-08-30 17:41:22,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:41:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2021-08-30 17:41:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-30 17:41:22,435 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:22,435 INFO L513 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:22,452 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:41:22,640 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,SelfDestructingSolverStorable15 [2021-08-30 17:41:22,641 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:22,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1260310061, now seen corresponding path program 2 times [2021-08-30 17:41:22,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:22,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891373163] [2021-08-30 17:41:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:22,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 144 proven. 26 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:41:22,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:22,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891373163] [2021-08-30 17:41:22,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891373163] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:22,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712101659] [2021-08-30 17:41:22,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:41:22,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:22,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:22,773 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:22,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-30 17:41:22,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:41:22,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:22,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 17:41:22,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:41:23,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:41:23,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712101659] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:23,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:23,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-08-30 17:41:23,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528008798] [2021-08-30 17:41:23,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-30 17:41:23,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-30 17:41:23,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-08-30 17:41:23,264 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:41:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:23,551 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2021-08-30 17:41:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-30 17:41:23,551 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 78 [2021-08-30 17:41:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:23,552 INFO L225 Difference]: With dead ends: 158 [2021-08-30 17:41:23,552 INFO L226 Difference]: Without dead ends: 158 [2021-08-30 17:41:23,553 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 223.88ms TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2021-08-30 17:41:23,553 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 103 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 146.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.07ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 179.51ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:23,553 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 30 Invalid, 389 Unknown, 0 Unchecked, 2.07ms Time], IncrementalHoareTripleChecker [27 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 179.51ms Time] [2021-08-30 17:41:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-30 17:41:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2021-08-30 17:41:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 128 states have (on average 1.1171875) internal successors, (143), 131 states have internal predecessors, (143), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2021-08-30 17:41:23,557 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 78 [2021-08-30 17:41:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:23,557 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2021-08-30 17:41:23,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:41:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2021-08-30 17:41:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-30 17:41:23,558 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:23,558 INFO L513 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:23,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:23,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-30 17:41:23,769 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -526178640, now seen corresponding path program 3 times [2021-08-30 17:41:23,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:23,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781760551] [2021-08-30 17:41:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:23,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 304 proven. 26 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-08-30 17:41:23,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:23,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781760551] [2021-08-30 17:41:23,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781760551] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:23,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050189996] [2021-08-30 17:41:23,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:41:23,882 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:23,885 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:23,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-30 17:41:23,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-30 17:41:23,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:23,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-30 17:41:23,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 210 proven. 4 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-08-30 17:41:24,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 197 proven. 17 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-08-30 17:41:24,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050189996] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:24,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:24,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 20 [2021-08-30 17:41:24,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983822032] [2021-08-30 17:41:24,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-30 17:41:24,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:24,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-30 17:41:24,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-08-30 17:41:24,414 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-30 17:41:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:24,977 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2021-08-30 17:41:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-30 17:41:24,978 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 104 [2021-08-30 17:41:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:24,979 INFO L225 Difference]: With dead ends: 164 [2021-08-30 17:41:24,979 INFO L226 Difference]: Without dead ends: 158 [2021-08-30 17:41:24,980 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 385.72ms TimeCoverageRelationStatistics Valid=244, Invalid=878, Unknown=0, NotChecked=0, Total=1122 [2021-08-30 17:41:24,980 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 290 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 229.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.60ms SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 294.58ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:24,980 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 52 Invalid, 679 Unknown, 0 Unchecked, 4.60ms Time], IncrementalHoareTripleChecker [59 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 294.58ms Time] [2021-08-30 17:41:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-30 17:41:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2021-08-30 17:41:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 128 states have (on average 1.09375) internal successors, (140), 130 states have internal predecessors, (140), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2021-08-30 17:41:24,984 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 104 [2021-08-30 17:41:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:24,984 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2021-08-30 17:41:24,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-30 17:41:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2021-08-30 17:41:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-08-30 17:41:24,986 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:24,986 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:25,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:25,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-30 17:41:25,205 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1118070359, now seen corresponding path program 1 times [2021-08-30 17:41:25,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:25,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146004417] [2021-08-30 17:41:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:25,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:25,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 225 proven. 42 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-08-30 17:41:25,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:25,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146004417] [2021-08-30 17:41:25,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146004417] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:25,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120737088] [2021-08-30 17:41:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:25,345 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:25,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:25,351 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:25,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-30 17:41:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:25,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-30 17:41:25,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:25,436 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:41:25,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:41:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 225 proven. 42 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-08-30 17:41:25,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 225 proven. 42 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-08-30 17:41:26,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120737088] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:26,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:26,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2021-08-30 17:41:26,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287582092] [2021-08-30 17:41:26,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-30 17:41:26,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-30 17:41:26,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-08-30 17:41:26,271 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 20 states have internal predecessors, (100), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:41:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:26,803 INFO L93 Difference]: Finished difference Result 190 states and 205 transitions. [2021-08-30 17:41:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-30 17:41:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 20 states have internal predecessors, (100), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 110 [2021-08-30 17:41:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:26,805 INFO L225 Difference]: With dead ends: 190 [2021-08-30 17:41:26,805 INFO L226 Difference]: Without dead ends: 190 [2021-08-30 17:41:26,806 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 211 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 428.64ms TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2021-08-30 17:41:26,807 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 262 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 251.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.67ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 296.65ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:26,807 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 41 Invalid, 627 Unknown, 0 Unchecked, 4.67ms Time], IncrementalHoareTripleChecker [36 Valid, 581 Invalid, 0 Unknown, 10 Unchecked, 296.65ms Time] [2021-08-30 17:41:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-08-30 17:41:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2021-08-30 17:41:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 158 states have (on average 1.1139240506329113) internal successors, (176), 160 states have internal predecessors, (176), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2021-08-30 17:41:26,814 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 110 [2021-08-30 17:41:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:26,815 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2021-08-30 17:41:26,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 20 states have internal predecessors, (100), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:41:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2021-08-30 17:41:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-30 17:41:26,816 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:26,816 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:26,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-08-30 17:41:27,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:27,033 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash -118889443, now seen corresponding path program 2 times [2021-08-30 17:41:27,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:27,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827637757] [2021-08-30 17:41:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:27,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:27,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:27,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:27,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2021-08-30 17:41:27,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:27,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827637757] [2021-08-30 17:41:27,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827637757] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:27,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120549209] [2021-08-30 17:41:27,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:41:27,148 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:27,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:27,153 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:27,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-30 17:41:27,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 17:41:27,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:27,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:41:27,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:27,218 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:41:27,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-30 17:41:27,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-08-30 17:41:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2021-08-30 17:41:27,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:41:27,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120549209] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:27,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:41:27,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-08-30 17:41:27,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188909126] [2021-08-30 17:41:27,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:41:27,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:41:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-30 17:41:27,865 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 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:41:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:27,874 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2021-08-30 17:41:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:41:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2021-08-30 17:41:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:27,876 INFO L225 Difference]: With dead ends: 172 [2021-08-30 17:41:27,876 INFO L226 Difference]: Without dead ends: 172 [2021-08-30 17:41:27,876 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 72.20ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-30 17:41:27,877 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.21ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 6.51ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:27,877 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 43 Unknown, 0 Unchecked, 0.21ms Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 32 Unchecked, 6.51ms Time] [2021-08-30 17:41:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-30 17:41:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-08-30 17:41:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 158 states have (on average 1.1075949367088607) internal successors, (175), 160 states have internal predecessors, (175), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:41:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2021-08-30 17:41:27,884 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 119 [2021-08-30 17:41:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:27,884 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2021-08-30 17:41:27,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 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:41:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2021-08-30 17:41:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-30 17:41:27,886 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:27,886 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:27,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:28,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-08-30 17:41:28,101 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr4ENSURES_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1512623851, now seen corresponding path program 1 times [2021-08-30 17:41:28,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:28,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124001930] [2021-08-30 17:41:28,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:28,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:28,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:28,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:28,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2021-08-30 17:41:28,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:28,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124001930] [2021-08-30 17:41:28,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124001930] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:28,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842778963] [2021-08-30 17:41:28,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:28,186 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:28,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:28,189 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:28,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-30 17:41:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:28,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 17:41:28,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-08-30 17:41:28,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-08-30 17:41:28,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842778963] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:28,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:28,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 23 [2021-08-30 17:41:28,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2691284] [2021-08-30 17:41:28,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-30 17:41:28,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-30 17:41:28,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2021-08-30 17:41:28,939 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-30 17:41:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:29,403 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2021-08-30 17:41:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-30 17:41:29,404 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 122 [2021-08-30 17:41:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:29,404 INFO L225 Difference]: With dead ends: 212 [2021-08-30 17:41:29,405 INFO L226 Difference]: Without dead ends: 209 [2021-08-30 17:41:29,405 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 306.53ms TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2021-08-30 17:41:29,406 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 322 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 232.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.91ms SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 292.19ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:29,406 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 63 Invalid, 759 Unknown, 0 Unchecked, 2.91ms Time], IncrementalHoareTripleChecker [85 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 292.19ms Time] [2021-08-30 17:41:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-30 17:41:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 182. [2021-08-30 17:41:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 167 states have (on average 1.1077844311377245) internal successors, (185), 169 states have internal predecessors, (185), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-30 17:41:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2021-08-30 17:41:29,411 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 122 [2021-08-30 17:41:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:29,411 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2021-08-30 17:41:29,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-30 17:41:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2021-08-30 17:41:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-08-30 17:41:29,413 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:29,413 INFO L513 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:29,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-08-30 17:41:29,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:29,626 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash -842693559, now seen corresponding path program 2 times [2021-08-30 17:41:29,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:29,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195680306] [2021-08-30 17:41:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:29,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 579 proven. 153 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2021-08-30 17:41:29,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:29,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195680306] [2021-08-30 17:41:29,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195680306] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:29,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097615889] [2021-08-30 17:41:29,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:41:29,767 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:29,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:29,768 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:29,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-30 17:41:29,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:41:29,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:29,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-30 17:41:29,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 555 proven. 172 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2021-08-30 17:41:30,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:30,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-08-30 17:41:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 555 proven. 172 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2021-08-30 17:41:31,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097615889] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:31,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:31,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2021-08-30 17:41:31,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370319650] [2021-08-30 17:41:31,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-08-30 17:41:31,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:31,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-08-30 17:41:31,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2021-08-30 17:41:31,761 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 41 states, 41 states have (on average 3.902439024390244) internal successors, (160), 37 states have internal predecessors, (160), 13 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:41:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:32,510 INFO L93 Difference]: Finished difference Result 227 states and 235 transitions. [2021-08-30 17:41:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-30 17:41:32,513 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.902439024390244) internal successors, (160), 37 states have internal predecessors, (160), 13 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 140 [2021-08-30 17:41:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:32,514 INFO L225 Difference]: With dead ends: 227 [2021-08-30 17:41:32,514 INFO L226 Difference]: Without dead ends: 227 [2021-08-30 17:41:32,515 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 883.90ms TimeCoverageRelationStatistics Valid=583, Invalid=2839, Unknown=0, NotChecked=0, Total=3422 [2021-08-30 17:41:32,516 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 151 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 303.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.62ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 366.56ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:32,516 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 74 Invalid, 897 Unknown, 0 Unchecked, 5.62ms Time], IncrementalHoareTripleChecker [40 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 366.56ms Time] [2021-08-30 17:41:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-08-30 17:41:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2021-08-30 17:41:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 196 states have (on average 1.0918367346938775) internal successors, (214), 198 states have internal predecessors, (214), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-30 17:41:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 227 transitions. [2021-08-30 17:41:32,524 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 227 transitions. Word has length 140 [2021-08-30 17:41:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:32,525 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 227 transitions. [2021-08-30 17:41:32,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.902439024390244) internal successors, (160), 37 states have internal predecessors, (160), 13 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:41:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 227 transitions. [2021-08-30 17:41:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-08-30 17:41:32,527 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:32,527 INFO L513 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:32,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:32,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:32,740 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr4ENSURES_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash 375628841, now seen corresponding path program 2 times [2021-08-30 17:41:32,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:32,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425320114] [2021-08-30 17:41:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:32,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:32,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2021-08-30 17:41:32,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:32,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425320114] [2021-08-30 17:41:32,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425320114] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:32,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693238720] [2021-08-30 17:41:32,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:41:32,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:32,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:32,841 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:32,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-30 17:41:32,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 17:41:32,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:32,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:41:32,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:32,941 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:41:32,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:41:33,199 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:41:33,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:41:33,533 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:41:33,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:41:33,945 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:41:33,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:41:34,431 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:41:34,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:41:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2021-08-30 17:41:34,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:41:34,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693238720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:41:34,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:41:34,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2021-08-30 17:41:34,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152580865] [2021-08-30 17:41:34,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:41:34,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:41:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-30 17:41:34,950 INFO L87 Difference]: Start difference. First operand 212 states and 227 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 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:41:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:34,993 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2021-08-30 17:41:34,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:41:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 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) Word has length 163 [2021-08-30 17:41:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:34,995 INFO L225 Difference]: With dead ends: 212 [2021-08-30 17:41:34,995 INFO L226 Difference]: Without dead ends: 208 [2021-08-30 17:41:34,995 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 144.20ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-08-30 17:41:34,996 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.29ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 31.43ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:34,996 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 68 Unknown, 0 Unchecked, 0.29ms Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 20 Unchecked, 31.43ms Time] [2021-08-30 17:41:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-30 17:41:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2021-08-30 17:41:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 178 states have (on average 1.050561797752809) internal successors, (187), 179 states have internal predecessors, (187), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-30 17:41:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 200 transitions. [2021-08-30 17:41:35,000 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 200 transitions. Word has length 163 [2021-08-30 17:41:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:35,001 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 200 transitions. [2021-08-30 17:41:35,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 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:41:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 200 transitions. [2021-08-30 17:41:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-30 17:41:35,002 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:35,002 INFO L513 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:35,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:35,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-30 17:41:35,213 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:35,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1240316030, now seen corresponding path program 1 times [2021-08-30 17:41:35,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:35,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761817907] [2021-08-30 17:41:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:35,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2021-08-30 17:41:35,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:35,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761817907] [2021-08-30 17:41:35,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761817907] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:35,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930192875] [2021-08-30 17:41:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:35,308 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:35,309 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:35,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-30 17:41:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:35,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-30 17:41:35,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 465 proven. 55 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2021-08-30 17:41:35,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 465 proven. 55 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2021-08-30 17:41:36,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930192875] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:36,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:36,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 27 [2021-08-30 17:41:36,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79789169] [2021-08-30 17:41:36,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-30 17:41:36,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-30 17:41:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2021-08-30 17:41:36,202 INFO L87 Difference]: Start difference. First operand 193 states and 200 transitions. Second operand has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 26 states have internal predecessors, (128), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-08-30 17:41:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:36,665 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2021-08-30 17:41:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-30 17:41:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 26 states have internal predecessors, (128), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 164 [2021-08-30 17:41:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:36,670 INFO L225 Difference]: With dead ends: 234 [2021-08-30 17:41:36,670 INFO L226 Difference]: Without dead ends: 231 [2021-08-30 17:41:36,671 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 389.11ms TimeCoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2021-08-30 17:41:36,671 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 370 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 206.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.59ms SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 255.23ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:36,672 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 56 Invalid, 644 Unknown, 0 Unchecked, 2.59ms Time], IncrementalHoareTripleChecker [85 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 255.23ms Time] [2021-08-30 17:41:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-08-30 17:41:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 199. [2021-08-30 17:41:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 183 states have (on average 1.0437158469945356) internal successors, (191), 184 states have internal predecessors, (191), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-30 17:41:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 206 transitions. [2021-08-30 17:41:36,677 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 206 transitions. Word has length 164 [2021-08-30 17:41:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:36,677 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 206 transitions. [2021-08-30 17:41:36,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 26 states have internal predecessors, (128), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-08-30 17:41:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 206 transitions. [2021-08-30 17:41:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-30 17:41:36,678 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:36,678 INFO L513 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:36,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:36,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:36,892 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash -257043898, now seen corresponding path program 3 times [2021-08-30 17:41:36,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:36,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977629302] [2021-08-30 17:41:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:36,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1630 backedges. 880 proven. 171 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-08-30 17:41:37,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:37,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977629302] [2021-08-30 17:41:37,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977629302] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:37,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603614395] [2021-08-30 17:41:37,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:41:37,070 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:37,071 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:37,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-30 17:41:37,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-08-30 17:41:37,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:37,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-30 17:41:37,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:37,183 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:41:37,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:41:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1630 backedges. 795 proven. 351 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2021-08-30 17:41:38,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1630 backedges. 775 proven. 371 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2021-08-30 17:41:39,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603614395] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:39,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:39,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 46 [2021-08-30 17:41:39,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140440059] [2021-08-30 17:41:39,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-08-30 17:41:39,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-08-30 17:41:39,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2021-08-30 17:41:39,593 INFO L87 Difference]: Start difference. First operand 199 states and 206 transitions. Second operand has 46 states, 46 states have (on average 3.891304347826087) internal successors, (179), 42 states have internal predecessors, (179), 10 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-30 17:41:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:41,077 INFO L93 Difference]: Finished difference Result 321 states and 333 transitions. [2021-08-30 17:41:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-08-30 17:41:41,078 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.891304347826087) internal successors, (179), 42 states have internal predecessors, (179), 10 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 176 [2021-08-30 17:41:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:41,079 INFO L225 Difference]: With dead ends: 321 [2021-08-30 17:41:41,079 INFO L226 Difference]: Without dead ends: 321 [2021-08-30 17:41:41,081 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 341 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2314 ImplicationChecksByTransitivity, 1856.45ms TimeCoverageRelationStatistics Valid=1160, Invalid=6150, Unknown=0, NotChecked=0, Total=7310 [2021-08-30 17:41:41,081 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 555 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 225.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.95ms SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 972 IncrementalHoareTripleChecker+Unchecked, 292.97ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:41,081 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 67 Invalid, 1669 Unknown, 0 Unchecked, 3.95ms Time], IncrementalHoareTripleChecker [100 Valid, 597 Invalid, 0 Unknown, 972 Unchecked, 292.97ms Time] [2021-08-30 17:41:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-08-30 17:41:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 267. [2021-08-30 17:41:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 249 states have (on average 1.036144578313253) internal successors, (258), 250 states have internal predecessors, (258), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-30 17:41:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 275 transitions. [2021-08-30 17:41:41,087 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 275 transitions. Word has length 176 [2021-08-30 17:41:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:41,087 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 275 transitions. [2021-08-30 17:41:41,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.891304347826087) internal successors, (179), 42 states have internal predecessors, (179), 10 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-30 17:41:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 275 transitions. [2021-08-30 17:41:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-08-30 17:41:41,089 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:41,089 INFO L513 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:41,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:41,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:41,305 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash 902550469, now seen corresponding path program 2 times [2021-08-30 17:41:41,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:41,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775945596] [2021-08-30 17:41:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:41,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:41:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 1858 trivial. 0 not checked. [2021-08-30 17:41:41,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:41,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775945596] [2021-08-30 17:41:41,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775945596] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:41,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279514656] [2021-08-30 17:41:41,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:41:41,435 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:41,436 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:41,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-30 17:41:41,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:41:41,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:41,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-30 17:41:41,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 766 proven. 81 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2021-08-30 17:41:41,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 766 proven. 81 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2021-08-30 17:41:42,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279514656] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:42,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:42,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 31 [2021-08-30 17:41:42,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164117712] [2021-08-30 17:41:42,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-30 17:41:42,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-30 17:41:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2021-08-30 17:41:42,458 INFO L87 Difference]: Start difference. First operand 267 states and 275 transitions. Second operand has 31 states, 31 states have (on average 4.774193548387097) internal successors, (148), 30 states have internal predecessors, (148), 13 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-08-30 17:41:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:43,083 INFO L93 Difference]: Finished difference Result 321 states and 330 transitions. [2021-08-30 17:41:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-30 17:41:43,084 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.774193548387097) internal successors, (148), 30 states have internal predecessors, (148), 13 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 210 [2021-08-30 17:41:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:43,085 INFO L225 Difference]: With dead ends: 321 [2021-08-30 17:41:43,085 INFO L226 Difference]: Without dead ends: 318 [2021-08-30 17:41:43,086 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 466.46ms TimeCoverageRelationStatistics Valid=522, Invalid=2234, Unknown=0, NotChecked=0, Total=2756 [2021-08-30 17:41:43,087 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 465 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 268.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.97ms SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 362.99ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:43,087 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 61 Invalid, 766 Unknown, 0 Unchecked, 2.97ms Time], IncrementalHoareTripleChecker [131 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 362.99ms Time] [2021-08-30 17:41:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-08-30 17:41:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 277. [2021-08-30 17:41:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 259 states have (on average 1.0308880308880308) internal successors, (267), 259 states have internal predecessors, (267), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-30 17:41:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 284 transitions. [2021-08-30 17:41:43,099 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 284 transitions. Word has length 210 [2021-08-30 17:41:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:43,099 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 284 transitions. [2021-08-30 17:41:43,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.774193548387097) internal successors, (148), 30 states have internal predecessors, (148), 13 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-08-30 17:41:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 284 transitions. [2021-08-30 17:41:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-08-30 17:41:43,101 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:43,102 INFO L513 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:43,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:43,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:43,302 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:43,303 INFO L82 PathProgramCache]: Analyzing trace with hash 368710973, now seen corresponding path program 3 times [2021-08-30 17:41:43,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:43,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013464431] [2021-08-30 17:41:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:43,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:41:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:41:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3283 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 3150 trivial. 0 not checked. [2021-08-30 17:41:43,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:43,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013464431] [2021-08-30 17:41:43,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013464431] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:43,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100282574] [2021-08-30 17:41:43,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:41:43,475 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:43,477 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:43,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-30 17:41:43,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-30 17:41:43,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:43,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:41:43,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3283 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3262 trivial. 0 not checked. [2021-08-30 17:41:43,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:44,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-08-30 17:41:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3283 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3262 trivial. 0 not checked. [2021-08-30 17:41:44,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100282574] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:44,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:44,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2021-08-30 17:41:44,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830060627] [2021-08-30 17:41:44,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-30 17:41:44,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:44,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-30 17:41:44,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-08-30 17:41:44,404 INFO L87 Difference]: Start difference. First operand 277 states and 284 transitions. Second operand has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 22 states have internal predecessors, (89), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:41:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:44,797 INFO L93 Difference]: Finished difference Result 336 states and 349 transitions. [2021-08-30 17:41:44,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-30 17:41:44,798 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 22 states have internal predecessors, (89), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 261 [2021-08-30 17:41:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:44,800 INFO L225 Difference]: With dead ends: 336 [2021-08-30 17:41:44,800 INFO L226 Difference]: Without dead ends: 336 [2021-08-30 17:41:44,800 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 321.87ms TimeCoverageRelationStatistics Valid=362, Invalid=760, Unknown=0, NotChecked=0, Total=1122 [2021-08-30 17:41:44,801 INFO L928 BasicCegarLoop]: 16 mSDtfsCounter, 407 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 173.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.94ms SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 212.74ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:44,801 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 49 Invalid, 506 Unknown, 0 Unchecked, 1.94ms Time], IncrementalHoareTripleChecker [186 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 212.74ms Time] [2021-08-30 17:41:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-08-30 17:41:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 319. [2021-08-30 17:41:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 300 states have (on average 1.0266666666666666) internal successors, (308), 300 states have internal predecessors, (308), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-30 17:41:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 327 transitions. [2021-08-30 17:41:44,807 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 327 transitions. Word has length 261 [2021-08-30 17:41:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:44,808 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 327 transitions. [2021-08-30 17:41:44,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 22 states have internal predecessors, (89), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:41:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 327 transitions. [2021-08-30 17:41:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-08-30 17:41:44,809 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:44,809 INFO L513 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:44,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:45,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-30 17:41:45,032 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1796973729, now seen corresponding path program 4 times [2021-08-30 17:41:45,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:45,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478710841] [2021-08-30 17:41:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:45,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:41:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 1656 proven. 195 refuted. 0 times theorem prover too weak. 2001 trivial. 0 not checked. [2021-08-30 17:41:45,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:45,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478710841] [2021-08-30 17:41:45,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478710841] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:45,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097152402] [2021-08-30 17:41:45,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:41:45,269 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:45,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:45,277 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:45,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-30 17:41:45,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:41:45,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:45,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:41:45,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 1670 proven. 493 refuted. 0 times theorem prover too weak. 1689 trivial. 0 not checked. [2021-08-30 17:41:46,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 1670 proven. 493 refuted. 0 times theorem prover too weak. 1689 trivial. 0 not checked. [2021-08-30 17:41:46,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097152402] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:46,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:46,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 38 [2021-08-30 17:41:46,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984335623] [2021-08-30 17:41:46,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-30 17:41:46,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-30 17:41:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2021-08-30 17:41:46,527 INFO L87 Difference]: Start difference. First operand 319 states and 327 transitions. Second operand has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 36 states have internal predecessors, (173), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-30 17:41:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:47,386 INFO L93 Difference]: Finished difference Result 372 states and 381 transitions. [2021-08-30 17:41:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-30 17:41:47,387 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 36 states have internal predecessors, (173), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 263 [2021-08-30 17:41:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:47,389 INFO L225 Difference]: With dead ends: 372 [2021-08-30 17:41:47,389 INFO L226 Difference]: Without dead ends: 372 [2021-08-30 17:41:47,390 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 521 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 798.04ms TimeCoverageRelationStatistics Valid=828, Invalid=3594, Unknown=0, NotChecked=0, Total=4422 [2021-08-30 17:41:47,390 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 264 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 325.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.44ms SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 407.53ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:47,391 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 56 Invalid, 1050 Unknown, 0 Unchecked, 3.44ms Time], IncrementalHoareTripleChecker [79 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 407.53ms Time] [2021-08-30 17:41:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-08-30 17:41:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 327. [2021-08-30 17:41:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 307 states have (on average 1.0260586319218241) internal successors, (315), 308 states have internal predecessors, (315), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-08-30 17:41:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 334 transitions. [2021-08-30 17:41:47,398 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 334 transitions. Word has length 263 [2021-08-30 17:41:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:47,398 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 334 transitions. [2021-08-30 17:41:47,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 36 states have internal predecessors, (173), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-30 17:41:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 334 transitions. [2021-08-30 17:41:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2021-08-30 17:41:47,401 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:47,401 INFO L513 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:47,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:47,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-30 17:41:47,621 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash -691211906, now seen corresponding path program 5 times [2021-08-30 17:41:47,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:47,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495911458] [2021-08-30 17:41:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:47,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:41:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:41:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5429 backedges. 3032 proven. 144 refuted. 0 times theorem prover too weak. 2253 trivial. 0 not checked. [2021-08-30 17:41:47,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:47,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495911458] [2021-08-30 17:41:47,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495911458] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:47,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741176362] [2021-08-30 17:41:47,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:41:47,891 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:47,892 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:47,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-30 17:41:48,076 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2021-08-30 17:41:48,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:48,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-30 17:41:48,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5429 backedges. 2989 proven. 622 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2021-08-30 17:41:48,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5429 backedges. 2997 proven. 614 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2021-08-30 17:41:49,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741176362] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:49,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:49,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 22] total 44 [2021-08-30 17:41:49,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384597143] [2021-08-30 17:41:49,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-08-30 17:41:49,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-30 17:41:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2021-08-30 17:41:49,652 INFO L87 Difference]: Start difference. First operand 327 states and 334 transitions. Second operand has 44 states, 44 states have (on average 4.681818181818182) internal successors, (206), 43 states have internal predecessors, (206), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-08-30 17:41:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:50,439 INFO L93 Difference]: Finished difference Result 333 states and 339 transitions. [2021-08-30 17:41:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-30 17:41:50,439 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.681818181818182) internal successors, (206), 43 states have internal predecessors, (206), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 309 [2021-08-30 17:41:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:50,441 INFO L225 Difference]: With dead ends: 333 [2021-08-30 17:41:50,441 INFO L226 Difference]: Without dead ends: 330 [2021-08-30 17:41:50,442 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 607 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 924.62ms TimeCoverageRelationStatistics Valid=902, Invalid=3130, Unknown=0, NotChecked=0, Total=4032 [2021-08-30 17:41:50,443 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 524 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 326.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.85ms SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 399.63ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:50,443 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 59 Invalid, 1202 Unknown, 0 Unchecked, 2.85ms Time], IncrementalHoareTripleChecker [97 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 399.63ms Time] [2021-08-30 17:41:50,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-08-30 17:41:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-08-30 17:41:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 309 states have (on average 1.022653721682848) internal successors, (316), 311 states have internal predecessors, (316), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-30 17:41:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 336 transitions. [2021-08-30 17:41:50,449 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 336 transitions. Word has length 309 [2021-08-30 17:41:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:50,450 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 336 transitions. [2021-08-30 17:41:50,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.681818181818182) internal successors, (206), 43 states have internal predecessors, (206), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-08-30 17:41:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 336 transitions. [2021-08-30 17:41:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2021-08-30 17:41:50,453 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:50,454 INFO L513 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:50,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-08-30 17:41:50,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-08-30 17:41:50,669 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2085134807, now seen corresponding path program 6 times [2021-08-30 17:41:50,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:50,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243810214] [2021-08-30 17:41:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:50,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:41:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:41:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 2131 proven. 201 refuted. 0 times theorem prover too weak. 3327 trivial. 0 not checked. [2021-08-30 17:41:50,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:50,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243810214] [2021-08-30 17:41:50,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243810214] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:50,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276184483] [2021-08-30 17:41:50,954 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:41:50,955 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:50,961 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:50,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-30 17:41:51,135 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2021-08-30 17:41:51,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:51,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-30 17:41:51,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:51,170 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:41:51,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:41:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 1939 proven. 160 refuted. 0 times theorem prover too weak. 3560 trivial. 0 not checked. [2021-08-30 17:41:52,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 1939 proven. 160 refuted. 0 times theorem prover too weak. 3560 trivial. 0 not checked. [2021-08-30 17:41:54,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276184483] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:54,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:54,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 13] total 48 [2021-08-30 17:41:54,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852565240] [2021-08-30 17:41:54,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-08-30 17:41:54,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:54,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-08-30 17:41:54,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2021-08-30 17:41:54,113 INFO L87 Difference]: Start difference. First operand 330 states and 336 transitions. Second operand has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 44 states have internal predecessors, (203), 25 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-08-30 17:41:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:55,266 INFO L93 Difference]: Finished difference Result 491 states and 514 transitions. [2021-08-30 17:41:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-30 17:41:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 44 states have internal predecessors, (203), 25 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 314 [2021-08-30 17:41:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:55,268 INFO L225 Difference]: With dead ends: 491 [2021-08-30 17:41:55,268 INFO L226 Difference]: Without dead ends: 491 [2021-08-30 17:41:55,270 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 610 SyntacticMatches, 13 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 1401.01ms TimeCoverageRelationStatistics Valid=1013, Invalid=4687, Unknown=0, NotChecked=0, Total=5700 [2021-08-30 17:41:55,270 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 243 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 412.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.10ms SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 514.32ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:55,271 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 81 Invalid, 1332 Unknown, 0 Unchecked, 3.10ms Time], IncrementalHoareTripleChecker [89 Valid, 1141 Invalid, 0 Unknown, 102 Unchecked, 514.32ms Time] [2021-08-30 17:41:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-08-30 17:41:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 468. [2021-08-30 17:41:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 437 states have (on average 1.036613272311213) internal successors, (453), 440 states have internal predecessors, (453), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2021-08-30 17:41:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 489 transitions. [2021-08-30 17:41:55,280 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 489 transitions. Word has length 314 [2021-08-30 17:41:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:55,280 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 489 transitions. [2021-08-30 17:41:55,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 44 states have internal predecessors, (203), 25 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-08-30 17:41:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 489 transitions. [2021-08-30 17:41:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2021-08-30 17:41:55,283 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:55,283 INFO L513 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:55,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:55,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:55,497 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1848654299, now seen corresponding path program 4 times [2021-08-30 17:41:55,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:55,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312704082] [2021-08-30 17:41:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:55,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:41:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:41:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:41:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5375 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 5199 trivial. 0 not checked. [2021-08-30 17:41:55,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:55,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312704082] [2021-08-30 17:41:55,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312704082] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:55,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442585552] [2021-08-30 17:41:55,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:41:55,674 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:55,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:55,677 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:55,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-30 17:41:55,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:41:55,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:55,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:41:55,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:41:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5375 backedges. 1602 proven. 647 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2021-08-30 17:41:56,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:41:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5375 backedges. 1608 proven. 641 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2021-08-30 17:41:57,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442585552] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:41:57,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:41:57,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 23] total 44 [2021-08-30 17:41:57,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78998143] [2021-08-30 17:41:57,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-08-30 17:41:57,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:41:57,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-30 17:41:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2021-08-30 17:41:57,385 INFO L87 Difference]: Start difference. First operand 468 states and 489 transitions. Second operand has 44 states, 44 states have (on average 4.75) internal successors, (209), 43 states have internal predecessors, (209), 16 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2021-08-30 17:41:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:41:58,517 INFO L93 Difference]: Finished difference Result 486 states and 504 transitions. [2021-08-30 17:41:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-30 17:41:58,517 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.75) internal successors, (209), 43 states have internal predecessors, (209), 16 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) Word has length 353 [2021-08-30 17:41:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:41:58,520 INFO L225 Difference]: With dead ends: 486 [2021-08-30 17:41:58,520 INFO L226 Difference]: Without dead ends: 477 [2021-08-30 17:41:58,521 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 939.33ms TimeCoverageRelationStatistics Valid=941, Invalid=4461, Unknown=0, NotChecked=0, Total=5402 [2021-08-30 17:41:58,522 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 764 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 491.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.30ms SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 599.10ms IncrementalHoareTripleChecker+Time [2021-08-30 17:41:58,522 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 77 Invalid, 1545 Unknown, 0 Unchecked, 4.30ms Time], IncrementalHoareTripleChecker [210 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 599.10ms Time] [2021-08-30 17:41:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-08-30 17:41:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2021-08-30 17:41:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 442 states have (on average 1.0294117647058822) internal successors, (455), 445 states have internal predecessors, (455), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2021-08-30 17:41:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 491 transitions. [2021-08-30 17:41:58,530 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 491 transitions. Word has length 353 [2021-08-30 17:41:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:41:58,531 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 491 transitions. [2021-08-30 17:41:58,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.75) internal successors, (209), 43 states have internal predecessors, (209), 16 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2021-08-30 17:41:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 491 transitions. [2021-08-30 17:41:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2021-08-30 17:41:58,533 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:41:58,534 INFO L513 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:41:58,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-08-30 17:41:58,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:58,753 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:41:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:41:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash 229226461, now seen corresponding path program 5 times [2021-08-30 17:41:58,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:41:58,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706097260] [2021-08-30 17:41:58,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:41:58,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:41:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:41:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:41:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:41:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:41:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:41:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:41:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:41:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:41:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:41:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:41:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:41:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7972 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 7747 trivial. 0 not checked. [2021-08-30 17:41:58,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:41:58,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706097260] [2021-08-30 17:41:58,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706097260] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:41:58,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483276511] [2021-08-30 17:41:58,973 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:41:58,974 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:41:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:41:58,974 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:41:58,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-30 17:41:59,374 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2021-08-30 17:41:59,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:41:59,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-30 17:41:59,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7972 backedges. 2246 proven. 1017 refuted. 0 times theorem prover too weak. 4709 trivial. 0 not checked. [2021-08-30 17:42:00,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7972 backedges. 2254 proven. 1009 refuted. 0 times theorem prover too weak. 4709 trivial. 0 not checked. [2021-08-30 17:42:01,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483276511] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:01,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:01,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26, 26] total 51 [2021-08-30 17:42:01,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300450296] [2021-08-30 17:42:01,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-08-30 17:42:01,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:01,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-08-30 17:42:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=2200, Unknown=0, NotChecked=0, Total=2550 [2021-08-30 17:42:01,380 INFO L87 Difference]: Start difference. First operand 473 states and 491 transitions. Second operand has 51 states, 51 states have (on average 4.666666666666667) internal successors, (238), 50 states have internal predecessors, (238), 17 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) [2021-08-30 17:42:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:02,622 INFO L93 Difference]: Finished difference Result 492 states and 508 transitions. [2021-08-30 17:42:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-30 17:42:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.666666666666667) internal successors, (238), 50 states have internal predecessors, (238), 17 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) Word has length 414 [2021-08-30 17:42:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:02,625 INFO L225 Difference]: With dead ends: 492 [2021-08-30 17:42:02,625 INFO L226 Difference]: Without dead ends: 486 [2021-08-30 17:42:02,626 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 1214.57ms TimeCoverageRelationStatistics Valid=1297, Invalid=6359, Unknown=0, NotChecked=0, Total=7656 [2021-08-30 17:42:02,626 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 930 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 494.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 598.61ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:02,626 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 88 Invalid, 1733 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [228 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 598.61ms Time] [2021-08-30 17:42:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-08-30 17:42:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 478. [2021-08-30 17:42:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 447 states have (on average 1.0246085011185682) internal successors, (458), 450 states have internal predecessors, (458), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2021-08-30 17:42:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 494 transitions. [2021-08-30 17:42:02,635 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 494 transitions. Word has length 414 [2021-08-30 17:42:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:02,635 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 494 transitions. [2021-08-30 17:42:02,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.666666666666667) internal successors, (238), 50 states have internal predecessors, (238), 17 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) [2021-08-30 17:42:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 494 transitions. [2021-08-30 17:42:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2021-08-30 17:42:02,638 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:02,639 INFO L513 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:02,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:02,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-08-30 17:42:02,853 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1776992160, now seen corresponding path program 6 times [2021-08-30 17:42:02,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:02,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549055602] [2021-08-30 17:42:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:02,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11425 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 11145 trivial. 0 not checked. [2021-08-30 17:42:03,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:03,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549055602] [2021-08-30 17:42:03,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549055602] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:03,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759715012] [2021-08-30 17:42:03,076 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:42:03,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:03,077 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:03,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-30 17:42:03,162 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-30 17:42:03,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:03,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:42:03,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:03,184 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:42:03,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-30 17:42:03,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-08-30 17:42:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11425 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11387 trivial. 0 not checked. [2021-08-30 17:42:05,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:42:05,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759715012] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:05,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:42:05,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 19 [2021-08-30 17:42:05,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513250848] [2021-08-30 17:42:05,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 17:42:05,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:05,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 17:42:05,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-08-30 17:42:05,601 INFO L87 Difference]: Start difference. First operand 478 states and 494 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (3), 2 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:42:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:05,613 INFO L93 Difference]: Finished difference Result 477 states and 493 transitions. [2021-08-30 17:42:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:42:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 480 [2021-08-30 17:42:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:05,616 INFO L225 Difference]: With dead ends: 477 [2021-08-30 17:42:05,616 INFO L226 Difference]: Without dead ends: 434 [2021-08-30 17:42:05,616 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 478 SyntacticMatches, 19 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 262.86ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-08-30 17:42:05,617 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.09ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 8.78ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:05,617 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 35 Unknown, 0 Unchecked, 0.09ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 32 Unchecked, 8.78ms Time] [2021-08-30 17:42:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-08-30 17:42:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-08-30 17:42:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 404 states have (on average 1.00990099009901) internal successors, (408), 406 states have internal predecessors, (408), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2021-08-30 17:42:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 444 transitions. [2021-08-30 17:42:05,625 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 444 transitions. Word has length 480 [2021-08-30 17:42:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:05,626 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 444 transitions. [2021-08-30 17:42:05,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (3), 2 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:42:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 444 transitions. [2021-08-30 17:42:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2021-08-30 17:42:05,637 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:05,637 INFO L513 BasicCegarLoop]: trace histogram [125, 125, 124, 124, 124, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:05,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:05,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-08-30 17:42:05,861 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1963837924, now seen corresponding path program 7 times [2021-08-30 17:42:05,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:05,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092268397] [2021-08-30 17:42:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:05,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2021-08-30 17:42:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2021-08-30 17:42:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2021-08-30 17:42:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 620 [2021-08-30 17:42:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 681 [2021-08-30 17:42:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 41577 backedges. 16529 proven. 805 refuted. 0 times theorem prover too weak. 24243 trivial. 0 not checked. [2021-08-30 17:42:06,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:06,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092268397] [2021-08-30 17:42:06,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092268397] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:06,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142680655] [2021-08-30 17:42:06,446 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:42:06,447 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:06,449 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:06,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-30 17:42:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:06,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:42:06,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 41577 backedges. 24032 proven. 235 refuted. 0 times theorem prover too weak. 17310 trivial. 0 not checked. [2021-08-30 17:42:08,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 41577 backedges. 9672 proven. 2855 refuted. 0 times theorem prover too weak. 29050 trivial. 0 not checked. [2021-08-30 17:42:09,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142680655] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:09,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:09,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 59 [2021-08-30 17:42:09,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455190034] [2021-08-30 17:42:09,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-08-30 17:42:09,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-08-30 17:42:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=2842, Unknown=0, NotChecked=0, Total=3422 [2021-08-30 17:42:09,399 INFO L87 Difference]: Start difference. First operand 434 states and 444 transitions. Second operand has 59 states, 59 states have (on average 4.9491525423728815) internal successors, (292), 58 states have internal predecessors, (292), 12 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2021-08-30 17:42:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:10,838 INFO L93 Difference]: Finished difference Result 457 states and 468 transitions. [2021-08-30 17:42:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-08-30 17:42:10,839 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 4.9491525423728815) internal successors, (292), 58 states have internal predecessors, (292), 12 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) Word has length 797 [2021-08-30 17:42:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:10,841 INFO L225 Difference]: With dead ends: 457 [2021-08-30 17:42:10,841 INFO L226 Difference]: Without dead ends: 454 [2021-08-30 17:42:10,842 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1686 GetRequests, 1594 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2173 ImplicationChecksByTransitivity, 1255.84ms TimeCoverageRelationStatistics Valid=1543, Invalid=6829, Unknown=0, NotChecked=0, Total=8372 [2021-08-30 17:42:10,842 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 381 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 769.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.44ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 957.52ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:10,843 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 101 Invalid, 2933 Unknown, 0 Unchecked, 6.44ms Time], IncrementalHoareTripleChecker [53 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 957.52ms Time] [2021-08-30 17:42:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-30 17:42:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 445. [2021-08-30 17:42:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 414 states have (on average 1.0120772946859904) internal successors, (419), 417 states have internal predecessors, (419), 18 states have call successors, (18), 11 states have call predecessors, (18), 12 states have return successors, (19), 16 states have call predecessors, (19), 17 states have call successors, (19) [2021-08-30 17:42:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 456 transitions. [2021-08-30 17:42:10,850 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 456 transitions. Word has length 797 [2021-08-30 17:42:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:10,851 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 456 transitions. [2021-08-30 17:42:10,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.9491525423728815) internal successors, (292), 58 states have internal predecessors, (292), 12 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2021-08-30 17:42:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 456 transitions. [2021-08-30 17:42:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2021-08-30 17:42:10,857 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:10,857 INFO L513 BasicCegarLoop]: trace histogram [131, 131, 130, 130, 130, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:10,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:11,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:11,077 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1800320658, now seen corresponding path program 8 times [2021-08-30 17:42:11,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:11,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398973564] [2021-08-30 17:42:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:11,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:42:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2021-08-30 17:42:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2021-08-30 17:42:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2021-08-30 17:42:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 706 [2021-08-30 17:42:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 45480 backedges. 18307 proven. 968 refuted. 0 times theorem prover too weak. 26205 trivial. 0 not checked. [2021-08-30 17:42:11,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:11,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398973564] [2021-08-30 17:42:11,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398973564] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:11,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346099571] [2021-08-30 17:42:11,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:11,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:11,687 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:11,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-30 17:42:11,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:42:11,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:11,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-30 17:42:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 45480 backedges. 26278 proven. 286 refuted. 0 times theorem prover too weak. 18916 trivial. 0 not checked. [2021-08-30 17:42:13,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 45480 backedges. 10930 proven. 2810 refuted. 0 times theorem prover too weak. 31740 trivial. 0 not checked. [2021-08-30 17:42:14,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346099571] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:14,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:14,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 64 [2021-08-30 17:42:14,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667825621] [2021-08-30 17:42:14,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-08-30 17:42:14,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:14,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-08-30 17:42:14,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=3352, Unknown=0, NotChecked=0, Total=4032 [2021-08-30 17:42:14,825 INFO L87 Difference]: Start difference. First operand 445 states and 456 transitions. Second operand has 64 states, 64 states have (on average 4.953125) internal successors, (317), 63 states have internal predecessors, (317), 13 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 12 states have call predecessors, (16), 13 states have call successors, (16) [2021-08-30 17:42:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:16,275 INFO L93 Difference]: Finished difference Result 533 states and 547 transitions. [2021-08-30 17:42:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-30 17:42:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 4.953125) internal successors, (317), 63 states have internal predecessors, (317), 13 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 12 states have call predecessors, (16), 13 states have call successors, (16) Word has length 827 [2021-08-30 17:42:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:16,278 INFO L225 Difference]: With dead ends: 533 [2021-08-30 17:42:16,278 INFO L226 Difference]: Without dead ends: 530 [2021-08-30 17:42:16,279 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1752 GetRequests, 1652 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 1450.15ms TimeCoverageRelationStatistics Valid=1808, Invalid=8092, Unknown=0, NotChecked=0, Total=9900 [2021-08-30 17:42:16,280 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 523 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 2870 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 730.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.41ms SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 905.08ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:16,280 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 104 Invalid, 2949 Unknown, 0 Unchecked, 6.41ms Time], IncrementalHoareTripleChecker [79 Valid, 2870 Invalid, 0 Unknown, 0 Unchecked, 905.08ms Time] [2021-08-30 17:42:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-30 17:42:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 516. [2021-08-30 17:42:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 483 states have (on average 1.0144927536231885) internal successors, (490), 486 states have internal predecessors, (490), 19 states have call successors, (19), 12 states have call predecessors, (19), 13 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2021-08-30 17:42:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 531 transitions. [2021-08-30 17:42:16,288 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 531 transitions. Word has length 827 [2021-08-30 17:42:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:16,289 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 531 transitions. [2021-08-30 17:42:16,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.953125) internal successors, (317), 63 states have internal predecessors, (317), 13 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 12 states have call predecessors, (16), 13 states have call successors, (16) [2021-08-30 17:42:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 531 transitions. [2021-08-30 17:42:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2021-08-30 17:42:16,296 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:16,296 INFO L513 BasicCegarLoop]: trace histogram [136, 136, 135, 135, 135, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:16,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:16,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:16,521 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:16,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:16,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1583933175, now seen corresponding path program 9 times [2021-08-30 17:42:16,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:16,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356108673] [2021-08-30 17:42:16,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:16,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:42:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:42:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2021-08-30 17:42:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 655 [2021-08-30 17:42:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 726 [2021-08-30 17:42:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 48870 backedges. 19995 proven. 1146 refuted. 0 times theorem prover too weak. 27729 trivial. 0 not checked. [2021-08-30 17:42:17,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:17,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356108673] [2021-08-30 17:42:17,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356108673] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:17,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600941807] [2021-08-30 17:42:17,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:42:17,195 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:17,196 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:17,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-30 17:42:17,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-08-30 17:42:17,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:17,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:42:17,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:17,368 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:42:17,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:42:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 48870 backedges. 6805 proven. 255 refuted. 0 times theorem prover too weak. 41810 trivial. 0 not checked. [2021-08-30 17:42:20,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 48870 backedges. 6805 proven. 255 refuted. 0 times theorem prover too weak. 41810 trivial. 0 not checked. [2021-08-30 17:42:22,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600941807] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:22,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:22,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16, 15] total 62 [2021-08-30 17:42:22,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198124141] [2021-08-30 17:42:22,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-08-30 17:42:22,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:22,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-08-30 17:42:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=3254, Unknown=0, NotChecked=0, Total=3782 [2021-08-30 17:42:22,055 INFO L87 Difference]: Start difference. First operand 516 states and 531 transitions. Second operand has 62 states, 62 states have (on average 4.709677419354839) internal successors, (292), 59 states have internal predecessors, (292), 5 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 17:42:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:24,722 INFO L93 Difference]: Finished difference Result 757 states and 876 transitions. [2021-08-30 17:42:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-30 17:42:24,723 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.709677419354839) internal successors, (292), 59 states have internal predecessors, (292), 5 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 852 [2021-08-30 17:42:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:24,726 INFO L225 Difference]: With dead ends: 757 [2021-08-30 17:42:24,726 INFO L226 Difference]: Without dead ends: 754 [2021-08-30 17:42:24,727 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1818 GetRequests, 1679 SyntacticMatches, 29 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3507 ImplicationChecksByTransitivity, 3130.60ms TimeCoverageRelationStatistics Valid=2374, Invalid=10058, Unknown=0, NotChecked=0, Total=12432 [2021-08-30 17:42:24,728 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 1360 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 2587 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 779.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.08ms SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 2587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 957.08ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:24,728 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1360 Valid, 70 Invalid, 2783 Unknown, 0 Unchecked, 7.08ms Time], IncrementalHoareTripleChecker [179 Valid, 2587 Invalid, 0 Unknown, 17 Unchecked, 957.08ms Time] [2021-08-30 17:42:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-08-30 17:42:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 645. [2021-08-30 17:42:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 609 states have (on average 1.026272577996716) internal successors, (625), 612 states have internal predecessors, (625), 21 states have call successors, (21), 13 states have call predecessors, (21), 14 states have return successors, (28), 19 states have call predecessors, (28), 20 states have call successors, (28) [2021-08-30 17:42:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 674 transitions. [2021-08-30 17:42:24,752 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 674 transitions. Word has length 852 [2021-08-30 17:42:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:24,752 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 674 transitions. [2021-08-30 17:42:24,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.709677419354839) internal successors, (292), 59 states have internal predecessors, (292), 5 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 17:42:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 674 transitions. [2021-08-30 17:42:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2021-08-30 17:42:24,760 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:24,761 INFO L513 BasicCegarLoop]: trace histogram [152, 152, 151, 151, 151, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:24,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:24,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:24,977 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:24,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash 394424125, now seen corresponding path program 10 times [2021-08-30 17:42:24,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:24,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236287269] [2021-08-30 17:42:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:24,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:42:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:42:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:42:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665 [2021-08-30 17:42:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 741 [2021-08-30 17:42:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 60558 backedges. 29483 proven. 1339 refuted. 0 times theorem prover too weak. 29736 trivial. 0 not checked. [2021-08-30 17:42:25,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:25,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236287269] [2021-08-30 17:42:25,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236287269] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:25,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700248561] [2021-08-30 17:42:25,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:42:25,732 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:25,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:25,733 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:25,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-30 17:42:25,999 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:42:25,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:26,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 2006 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-30 17:42:26,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60558 backedges. 32653 proven. 1592 refuted. 0 times theorem prover too weak. 26313 trivial. 0 not checked. [2021-08-30 17:42:27,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 60558 backedges. 21581 proven. 3634 refuted. 0 times theorem prover too weak. 35343 trivial. 0 not checked. [2021-08-30 17:42:29,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700248561] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:29,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:29,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 33] total 79 [2021-08-30 17:42:29,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389548039] [2021-08-30 17:42:29,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2021-08-30 17:42:29,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:29,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-08-30 17:42:29,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=5185, Unknown=0, NotChecked=0, Total=6162 [2021-08-30 17:42:29,599 INFO L87 Difference]: Start difference. First operand 645 states and 674 transitions. Second operand has 79 states, 79 states have (on average 4.886075949367089) internal successors, (386), 78 states have internal predecessors, (386), 14 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-08-30 17:42:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:31,613 INFO L93 Difference]: Finished difference Result 752 states and 790 transitions. [2021-08-30 17:42:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-08-30 17:42:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 4.886075949367089) internal successors, (386), 78 states have internal predecessors, (386), 14 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) Word has length 932 [2021-08-30 17:42:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:31,617 INFO L225 Difference]: With dead ends: 752 [2021-08-30 17:42:31,617 INFO L226 Difference]: Without dead ends: 749 [2021-08-30 17:42:31,619 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1971 GetRequests, 1849 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4163 ImplicationChecksByTransitivity, 1994.13ms TimeCoverageRelationStatistics Valid=2728, Invalid=12034, Unknown=0, NotChecked=0, Total=14762 [2021-08-30 17:42:31,620 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 566 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 4060 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1054.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.31ms SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 4060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1287.41ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:31,620 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 97 Invalid, 4182 Unknown, 0 Unchecked, 9.31ms Time], IncrementalHoareTripleChecker [122 Valid, 4060 Invalid, 0 Unknown, 0 Unchecked, 1287.41ms Time] [2021-08-30 17:42:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-08-30 17:42:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 733. [2021-08-30 17:42:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 693 states have (on average 1.023088023088023) internal successors, (709), 696 states have internal predecessors, (709), 24 states have call successors, (24), 14 states have call predecessors, (24), 15 states have return successors, (38), 22 states have call predecessors, (38), 23 states have call successors, (38) [2021-08-30 17:42:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 771 transitions. [2021-08-30 17:42:31,634 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 771 transitions. Word has length 932 [2021-08-30 17:42:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:31,635 INFO L470 AbstractCegarLoop]: Abstraction has 733 states and 771 transitions. [2021-08-30 17:42:31,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.886075949367089) internal successors, (386), 78 states have internal predecessors, (386), 14 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-08-30 17:42:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 771 transitions. [2021-08-30 17:42:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2021-08-30 17:42:31,645 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:31,645 INFO L513 BasicCegarLoop]: trace histogram [155, 155, 154, 154, 154, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:31,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:31,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-08-30 17:42:31,869 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1559536828, now seen corresponding path program 11 times [2021-08-30 17:42:31,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:31,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759532132] [2021-08-30 17:42:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:31,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:42:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:42:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:42:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:42:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2021-08-30 17:42:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 62892 backedges. 31081 proven. 1547 refuted. 0 times theorem prover too weak. 30264 trivial. 0 not checked. [2021-08-30 17:42:32,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:32,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759532132] [2021-08-30 17:42:32,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759532132] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:32,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753992672] [2021-08-30 17:42:32,746 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:42:32,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:32,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:32,749 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:32,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-30 17:42:34,410 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2021-08-30 17:42:34,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:34,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 2300 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-30 17:42:34,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 62892 backedges. 34904 proven. 2412 refuted. 0 times theorem prover too weak. 25576 trivial. 0 not checked. [2021-08-30 17:42:36,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 62892 backedges. 27904 proven. 4327 refuted. 0 times theorem prover too weak. 30661 trivial. 0 not checked. [2021-08-30 17:42:38,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753992672] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:38,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:38,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 97 [2021-08-30 17:42:38,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720900006] [2021-08-30 17:42:38,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2021-08-30 17:42:38,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:38,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-08-30 17:42:38,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=7751, Unknown=0, NotChecked=0, Total=9312 [2021-08-30 17:42:38,755 INFO L87 Difference]: Start difference. First operand 733 states and 771 transitions. Second operand has 97 states, 97 states have (on average 4.804123711340206) internal successors, (466), 96 states have internal predecessors, (466), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-30 17:42:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:40,572 INFO L93 Difference]: Finished difference Result 855 states and 907 transitions. [2021-08-30 17:42:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-08-30 17:42:40,573 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 4.804123711340206) internal successors, (466), 96 states have internal predecessors, (466), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 947 [2021-08-30 17:42:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:40,576 INFO L225 Difference]: With dead ends: 855 [2021-08-30 17:42:40,576 INFO L226 Difference]: Without dead ends: 852 [2021-08-30 17:42:40,577 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2006 GetRequests, 1863 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5989 ImplicationChecksByTransitivity, 2608.97ms TimeCoverageRelationStatistics Valid=4296, Invalid=16010, Unknown=0, NotChecked=0, Total=20306 [2021-08-30 17:42:40,577 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 859 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 2886 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 798.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.59ms SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 2886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 971.36ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:40,578 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 64 Invalid, 3102 Unknown, 0 Unchecked, 8.59ms Time], IncrementalHoareTripleChecker [216 Valid, 2886 Invalid, 0 Unknown, 0 Unchecked, 971.36ms Time] [2021-08-30 17:42:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-08-30 17:42:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 832. [2021-08-30 17:42:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 787 states have (on average 1.0203303684879288) internal successors, (803), 790 states have internal predecessors, (803), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (53), 26 states have call predecessors, (53), 27 states have call successors, (53) [2021-08-30 17:42:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 884 transitions. [2021-08-30 17:42:40,590 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 884 transitions. Word has length 947 [2021-08-30 17:42:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:40,591 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 884 transitions. [2021-08-30 17:42:40,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 4.804123711340206) internal successors, (466), 96 states have internal predecessors, (466), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-30 17:42:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 884 transitions. [2021-08-30 17:42:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2021-08-30 17:42:40,600 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:40,601 INFO L513 BasicCegarLoop]: trace histogram [157, 157, 156, 156, 156, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:40,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-08-30 17:42:40,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-08-30 17:42:40,827 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1114152834, now seen corresponding path program 12 times [2021-08-30 17:42:40,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:40,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568576326] [2021-08-30 17:42:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:40,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:42:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:42:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:42:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:42:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:42:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 64473 backedges. 25392 proven. 620 refuted. 0 times theorem prover too weak. 38461 trivial. 0 not checked. [2021-08-30 17:42:41,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:41,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568576326] [2021-08-30 17:42:41,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568576326] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:41,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750765119] [2021-08-30 17:42:41,547 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:42:41,547 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:41,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:41,548 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:41,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-30 17:42:43,232 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2021-08-30 17:42:43,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:43,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 2432 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-30 17:42:43,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 64473 backedges. 32439 proven. 1770 refuted. 0 times theorem prover too weak. 30264 trivial. 0 not checked. [2021-08-30 17:42:45,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 64473 backedges. 32510 proven. 1699 refuted. 0 times theorem prover too weak. 30264 trivial. 0 not checked. [2021-08-30 17:42:48,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750765119] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:48,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:48,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37, 37] total 98 [2021-08-30 17:42:48,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775059314] [2021-08-30 17:42:48,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-08-30 17:42:48,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:48,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-08-30 17:42:48,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=8093, Unknown=0, NotChecked=0, Total=9506 [2021-08-30 17:42:48,047 INFO L87 Difference]: Start difference. First operand 832 states and 884 transitions. Second operand has 98 states, 98 states have (on average 4.959183673469388) internal successors, (486), 97 states have internal predecessors, (486), 17 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 16 states have call predecessors, (18), 16 states have call successors, (18) [2021-08-30 17:42:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:50,451 INFO L93 Difference]: Finished difference Result 969 states and 1041 transitions. [2021-08-30 17:42:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-08-30 17:42:50,452 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 4.959183673469388) internal successors, (486), 97 states have internal predecessors, (486), 17 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 16 states have call predecessors, (18), 16 states have call successors, (18) Word has length 957 [2021-08-30 17:42:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:50,456 INFO L225 Difference]: With dead ends: 969 [2021-08-30 17:42:50,456 INFO L226 Difference]: Without dead ends: 966 [2021-08-30 17:42:50,458 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1881 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6051 ImplicationChecksByTransitivity, 3264.52ms TimeCoverageRelationStatistics Valid=4130, Invalid=18220, Unknown=0, NotChecked=0, Total=22350 [2021-08-30 17:42:50,458 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 937 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 3541 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 932.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.23ms SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 3541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1135.96ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:50,459 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [938 Valid, 97 Invalid, 3697 Unknown, 0 Unchecked, 8.23ms Time], IncrementalHoareTripleChecker [156 Valid, 3541 Invalid, 0 Unknown, 0 Unchecked, 1135.96ms Time] [2021-08-30 17:42:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-08-30 17:42:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 942. [2021-08-30 17:42:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 891 states have (on average 1.0179573512906845) internal successors, (907), 894 states have internal predecessors, (907), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (74), 31 states have call predecessors, (74), 32 states have call successors, (74) [2021-08-30 17:42:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1014 transitions. [2021-08-30 17:42:50,474 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1014 transitions. Word has length 957 [2021-08-30 17:42:50,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:50,475 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1014 transitions. [2021-08-30 17:42:50,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 4.959183673469388) internal successors, (486), 97 states have internal predecessors, (486), 17 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 16 states have call predecessors, (18), 16 states have call successors, (18) [2021-08-30 17:42:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1014 transitions. [2021-08-30 17:42:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2021-08-30 17:42:50,485 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:50,485 INFO L513 BasicCegarLoop]: trace histogram [158, 158, 157, 157, 157, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:50,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:50,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-08-30 17:42:50,709 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash -395396055, now seen corresponding path program 13 times [2021-08-30 17:42:50,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:50,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908318776] [2021-08-30 17:42:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:50,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:42:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:42:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:42:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:42:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:42:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 65271 backedges. 16323 proven. 1113 refuted. 0 times theorem prover too weak. 47835 trivial. 0 not checked. [2021-08-30 17:42:51,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:51,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908318776] [2021-08-30 17:42:51,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908318776] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:51,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585798620] [2021-08-30 17:42:51,434 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:42:51,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:51,441 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:51,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-30 17:42:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:51,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-30 17:42:51,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 65271 backedges. 16776 proven. 660 refuted. 0 times theorem prover too weak. 47835 trivial. 0 not checked. [2021-08-30 17:42:53,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 65271 backedges. 16776 proven. 660 refuted. 0 times theorem prover too weak. 47835 trivial. 0 not checked. [2021-08-30 17:42:54,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585798620] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:54,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:54,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37, 37] total 58 [2021-08-30 17:42:54,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283868254] [2021-08-30 17:42:54,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-08-30 17:42:54,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-08-30 17:42:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=2562, Unknown=0, NotChecked=0, Total=3306 [2021-08-30 17:42:54,569 INFO L87 Difference]: Start difference. First operand 942 states and 1014 transitions. Second operand has 58 states, 58 states have (on average 4.862068965517241) internal successors, (282), 56 states have internal predecessors, (282), 18 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-08-30 17:42:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:55,860 INFO L93 Difference]: Finished difference Result 1053 states and 1147 transitions. [2021-08-30 17:42:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-30 17:42:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.862068965517241) internal successors, (282), 56 states have internal predecessors, (282), 18 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 962 [2021-08-30 17:42:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:55,865 INFO L225 Difference]: With dead ends: 1053 [2021-08-30 17:42:55,865 INFO L226 Difference]: Without dead ends: 1053 [2021-08-30 17:42:55,866 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2029 GetRequests, 1937 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1412.23ms TimeCoverageRelationStatistics Valid=2168, Invalid=6388, Unknown=0, NotChecked=0, Total=8556 [2021-08-30 17:42:55,866 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 146 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 513.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.99ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 634.00ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:55,867 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 50 Invalid, 1751 Unknown, 0 Unchecked, 3.99ms Time], IncrementalHoareTripleChecker [47 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 634.00ms Time] [2021-08-30 17:42:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-08-30 17:42:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1043. [2021-08-30 17:42:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 990 states have (on average 1.0171717171717172) internal successors, (1007), 993 states have internal predecessors, (1007), 34 states have call successors, (34), 17 states have call predecessors, (34), 18 states have return successors, (75), 32 states have call predecessors, (75), 33 states have call successors, (75) [2021-08-30 17:42:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1116 transitions. [2021-08-30 17:42:55,882 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1116 transitions. Word has length 962 [2021-08-30 17:42:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:55,882 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 1116 transitions. [2021-08-30 17:42:55,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 4.862068965517241) internal successors, (282), 56 states have internal predecessors, (282), 18 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-08-30 17:42:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1116 transitions. [2021-08-30 17:42:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1054 [2021-08-30 17:42:55,894 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:55,894 INFO L513 BasicCegarLoop]: trace histogram [174, 174, 173, 173, 173, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:55,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:56,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-08-30 17:42:56,109 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:56,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1248672607, now seen corresponding path program 14 times [2021-08-30 17:42:56,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:56,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844483499] [2021-08-30 17:42:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:56,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:42:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:42:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:42:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:42:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:42:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:42:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:42:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 79061 backedges. 29348 proven. 702 refuted. 0 times theorem prover too weak. 49011 trivial. 0 not checked. [2021-08-30 17:42:56,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:56,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844483499] [2021-08-30 17:42:56,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844483499] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:56,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61973166] [2021-08-30 17:42:56,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:56,851 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:56,852 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:56,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-30 17:42:57,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:42:57,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:57,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 2669 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-30 17:42:57,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 79061 backedges. 29434 proven. 616 refuted. 0 times theorem prover too weak. 49011 trivial. 0 not checked. [2021-08-30 17:42:59,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 79061 backedges. 29434 proven. 616 refuted. 0 times theorem prover too weak. 49011 trivial. 0 not checked. [2021-08-30 17:43:01,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61973166] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:01,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:01,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2021-08-30 17:43:01,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077401945] [2021-08-30 17:43:01,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-08-30 17:43:01,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:01,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-08-30 17:43:01,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1146, Invalid=3966, Unknown=0, NotChecked=0, Total=5112 [2021-08-30 17:43:01,087 INFO L87 Difference]: Start difference. First operand 1043 states and 1116 transitions. Second operand has 72 states, 72 states have (on average 4.930555555555555) internal successors, (355), 71 states have internal predecessors, (355), 19 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-08-30 17:43:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:02,474 INFO L93 Difference]: Finished difference Result 1052 states and 1144 transitions. [2021-08-30 17:43:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-08-30 17:43:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.930555555555555) internal successors, (355), 71 states have internal predecessors, (355), 19 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 1053 [2021-08-30 17:43:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:02,479 INFO L225 Difference]: With dead ends: 1052 [2021-08-30 17:43:02,479 INFO L226 Difference]: Without dead ends: 1046 [2021-08-30 17:43:02,480 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2211 GetRequests, 2103 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 1882.30ms TimeCoverageRelationStatistics Valid=2821, Invalid=8735, Unknown=0, NotChecked=0, Total=11556 [2021-08-30 17:43:02,480 INFO L928 BasicCegarLoop]: 20 mSDtfsCounter, 550 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 608.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.37ms SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 732.34ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:02,481 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 141 Invalid, 2185 Unknown, 0 Unchecked, 5.37ms Time], IncrementalHoareTripleChecker [84 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 732.34ms Time] [2021-08-30 17:43:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-08-30 17:43:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1043. [2021-08-30 17:43:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 990 states have (on average 1.0151515151515151) internal successors, (1005), 993 states have internal predecessors, (1005), 34 states have call successors, (34), 17 states have call predecessors, (34), 18 states have return successors, (75), 32 states have call predecessors, (75), 33 states have call successors, (75) [2021-08-30 17:43:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1114 transitions. [2021-08-30 17:43:02,496 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1114 transitions. Word has length 1053 [2021-08-30 17:43:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:02,496 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 1114 transitions. [2021-08-30 17:43:02,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.930555555555555) internal successors, (355), 71 states have internal predecessors, (355), 19 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-08-30 17:43:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1114 transitions. [2021-08-30 17:43:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2021-08-30 17:43:02,507 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:02,508 INFO L513 BasicCegarLoop]: trace histogram [175, 175, 174, 174, 174, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:02,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:02,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:02,720 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1783925274, now seen corresponding path program 15 times [2021-08-30 17:43:02,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:02,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781494367] [2021-08-30 17:43:02,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:02,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:43:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:43:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 79945 backedges. 18352 proven. 1143 refuted. 0 times theorem prover too weak. 60450 trivial. 0 not checked. [2021-08-30 17:43:03,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:03,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781494367] [2021-08-30 17:43:03,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781494367] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:03,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016346875] [2021-08-30 17:43:03,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:43:03,452 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:03,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:03,457 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:03,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-30 17:43:03,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2021-08-30 17:43:03,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:03,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-30 17:43:03,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:03,830 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:43:03,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:43:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 79945 backedges. 25820 proven. 3894 refuted. 0 times theorem prover too weak. 50231 trivial. 0 not checked. [2021-08-30 17:43:08,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 79945 backedges. 25648 proven. 4066 refuted. 0 times theorem prover too weak. 50231 trivial. 0 not checked. [2021-08-30 17:43:11,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016346875] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:11,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:11,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 28, 27] total 94 [2021-08-30 17:43:11,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812272304] [2021-08-30 17:43:11,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2021-08-30 17:43:11,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:11,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-08-30 17:43:11,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1016, Invalid=7726, Unknown=0, NotChecked=0, Total=8742 [2021-08-30 17:43:11,673 INFO L87 Difference]: Start difference. First operand 1043 states and 1114 transitions. Second operand has 94 states, 94 states have (on average 4.457446808510638) internal successors, (419), 90 states have internal predecessors, (419), 24 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 21 states have call successors, (23) [2021-08-30 17:43:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:16,298 INFO L93 Difference]: Finished difference Result 1276 states and 1376 transitions. [2021-08-30 17:43:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-08-30 17:43:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 4.457446808510638) internal successors, (419), 90 states have internal predecessors, (419), 24 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 21 states have call successors, (23) Word has length 1058 [2021-08-30 17:43:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:16,302 INFO L225 Difference]: With dead ends: 1276 [2021-08-30 17:43:16,302 INFO L226 Difference]: Without dead ends: 1276 [2021-08-30 17:43:16,304 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2325 GetRequests, 2104 SyntacticMatches, 30 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13255 ImplicationChecksByTransitivity, 6293.24ms TimeCoverageRelationStatistics Valid=5540, Invalid=31516, Unknown=0, NotChecked=0, Total=37056 [2021-08-30 17:43:16,304 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 707 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 533.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.30ms SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1574 IncrementalHoareTripleChecker+Unchecked, 637.41ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:16,304 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 84 Invalid, 3250 Unknown, 0 Unchecked, 5.30ms Time], IncrementalHoareTripleChecker [235 Valid, 1441 Invalid, 0 Unknown, 1574 Unchecked, 637.41ms Time] [2021-08-30 17:43:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2021-08-30 17:43:16,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1246. [2021-08-30 17:43:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1188 states have (on average 1.0143097643097643) internal successors, (1205), 1191 states have internal predecessors, (1205), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (78), 35 states have call predecessors, (78), 36 states have call successors, (78) [2021-08-30 17:43:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1320 transitions. [2021-08-30 17:43:16,320 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1320 transitions. Word has length 1058 [2021-08-30 17:43:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:16,321 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 1320 transitions. [2021-08-30 17:43:16,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 4.457446808510638) internal successors, (419), 90 states have internal predecessors, (419), 24 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 21 states have call successors, (23) [2021-08-30 17:43:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1320 transitions. [2021-08-30 17:43:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1347 [2021-08-30 17:43:16,336 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:16,336 INFO L513 BasicCegarLoop]: trace histogram [226, 226, 225, 225, 225, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:16,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:16,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-08-30 17:43:16,553 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash 128056093, now seen corresponding path program 16 times [2021-08-30 17:43:16,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:16,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318894656] [2021-08-30 17:43:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:16,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:43:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:43:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:43:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1039 [2021-08-30 17:43:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1135 [2021-08-30 17:43:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 132907 backedges. 54007 proven. 2261 refuted. 0 times theorem prover too weak. 76639 trivial. 0 not checked. [2021-08-30 17:43:17,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:17,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318894656] [2021-08-30 17:43:17,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318894656] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:17,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774157004] [2021-08-30 17:43:17,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:43:17,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:17,590 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:17,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-30 17:43:17,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:43:17,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:17,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-30 17:43:17,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 132907 backedges. 63583 proven. 2636 refuted. 0 times theorem prover too weak. 66688 trivial. 0 not checked. [2021-08-30 17:43:20,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 132907 backedges. 37663 proven. 5982 refuted. 0 times theorem prover too weak. 89262 trivial. 0 not checked. [2021-08-30 17:43:23,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774157004] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:23,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:23,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41, 41] total 99 [2021-08-30 17:43:23,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911305721] [2021-08-30 17:43:23,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2021-08-30 17:43:23,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2021-08-30 17:43:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1537, Invalid=8165, Unknown=0, NotChecked=0, Total=9702 [2021-08-30 17:43:23,082 INFO L87 Difference]: Start difference. First operand 1246 states and 1320 transitions. Second operand has 99 states, 99 states have (on average 4.909090909090909) internal successors, (486), 98 states have internal predecessors, (486), 18 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 18 states have call predecessors, (22), 18 states have call successors, (22) [2021-08-30 17:43:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:25,861 INFO L93 Difference]: Finished difference Result 1391 states and 1484 transitions. [2021-08-30 17:43:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-08-30 17:43:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 4.909090909090909) internal successors, (486), 98 states have internal predecessors, (486), 18 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 18 states have call predecessors, (22), 18 states have call successors, (22) Word has length 1346 [2021-08-30 17:43:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:25,866 INFO L225 Difference]: With dead ends: 1391 [2021-08-30 17:43:25,866 INFO L226 Difference]: Without dead ends: 1250 [2021-08-30 17:43:25,868 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2827 GetRequests, 2673 SyntacticMatches, 2 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6868 ImplicationChecksByTransitivity, 2963.02ms TimeCoverageRelationStatistics Valid=4254, Invalid=19308, Unknown=0, NotChecked=0, Total=23562 [2021-08-30 17:43:25,869 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 929 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 5469 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1443.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 5602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.31ms SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 5469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1735.19ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:25,869 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [930 Valid, 115 Invalid, 5602 Unknown, 0 Unchecked, 12.31ms Time], IncrementalHoareTripleChecker [133 Valid, 5469 Invalid, 0 Unknown, 0 Unchecked, 1735.19ms Time] [2021-08-30 17:43:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-08-30 17:43:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1246. [2021-08-30 17:43:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1188 states have (on average 1.0117845117845117) internal successors, (1202), 1191 states have internal predecessors, (1202), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (78), 35 states have call predecessors, (78), 36 states have call successors, (78) [2021-08-30 17:43:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1317 transitions. [2021-08-30 17:43:25,887 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1317 transitions. Word has length 1346 [2021-08-30 17:43:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:25,888 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 1317 transitions. [2021-08-30 17:43:25,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 4.909090909090909) internal successors, (486), 98 states have internal predecessors, (486), 18 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 18 states have call predecessors, (22), 18 states have call successors, (22) [2021-08-30 17:43:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1317 transitions. [2021-08-30 17:43:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1362 [2021-08-30 17:43:25,903 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:25,904 INFO L513 BasicCegarLoop]: trace histogram [229, 229, 228, 228, 228, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:25,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:26,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:26,117 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2059129188, now seen corresponding path program 17 times [2021-08-30 17:43:26,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:26,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694070011] [2021-08-30 17:43:26,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:26,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:43:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:43:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:43:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:43:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1145 [2021-08-30 17:43:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 136363 backedges. 56333 proven. 2529 refuted. 0 times theorem prover too weak. 77501 trivial. 0 not checked. [2021-08-30 17:43:27,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:27,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694070011] [2021-08-30 17:43:27,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694070011] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:27,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000202387] [2021-08-30 17:43:27,278 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:43:27,278 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:27,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:27,293 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:27,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-30 17:43:30,903 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2021-08-30 17:43:30,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:30,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-30 17:43:30,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 136363 backedges. 60154 proven. 7414 refuted. 0 times theorem prover too weak. 68795 trivial. 0 not checked. [2021-08-30 17:43:33,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 136363 backedges. 44728 proven. 10241 refuted. 0 times theorem prover too weak. 81394 trivial. 0 not checked. [2021-08-30 17:43:36,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000202387] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:36,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:36,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 117 [2021-08-30 17:43:36,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359223595] [2021-08-30 17:43:36,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2021-08-30 17:43:36,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2021-08-30 17:43:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=11359, Unknown=0, NotChecked=0, Total=13572 [2021-08-30 17:43:36,912 INFO L87 Difference]: Start difference. First operand 1246 states and 1317 transitions. Second operand has 117 states, 117 states have (on average 4.837606837606837) internal successors, (566), 116 states have internal predecessors, (566), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2021-08-30 17:43:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:40,002 INFO L93 Difference]: Finished difference Result 1520 states and 1603 transitions. [2021-08-30 17:43:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-08-30 17:43:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 4.837606837606837) internal successors, (566), 116 states have internal predecessors, (566), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 1361 [2021-08-30 17:43:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:40,006 INFO L225 Difference]: With dead ends: 1520 [2021-08-30 17:43:40,006 INFO L226 Difference]: Without dead ends: 1126 [2021-08-30 17:43:40,008 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2875 GetRequests, 2687 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10413 ImplicationChecksByTransitivity, 3846.65ms TimeCoverageRelationStatistics Valid=7212, Invalid=27944, Unknown=0, NotChecked=0, Total=35156 [2021-08-30 17:43:40,008 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 1242 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 5280 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1434.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.34ms SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 5280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1721.81ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:40,008 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 102 Invalid, 5481 Unknown, 0 Unchecked, 12.34ms Time], IncrementalHoareTripleChecker [201 Valid, 5280 Invalid, 0 Unknown, 0 Unchecked, 1721.81ms Time] [2021-08-30 17:43:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2021-08-30 17:43:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1122. [2021-08-30 17:43:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1076 states have (on average 1.012081784386617) internal successors, (1089), 1080 states have internal predecessors, (1089), 25 states have call successors, (25), 18 states have call predecessors, (25), 20 states have return successors, (32), 23 states have call predecessors, (32), 24 states have call successors, (32) [2021-08-30 17:43:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1146 transitions. [2021-08-30 17:43:40,023 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1146 transitions. Word has length 1361 [2021-08-30 17:43:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:40,024 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1146 transitions. [2021-08-30 17:43:40,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 4.837606837606837) internal successors, (566), 116 states have internal predecessors, (566), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2021-08-30 17:43:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1146 transitions. [2021-08-30 17:43:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1372 [2021-08-30 17:43:40,038 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:40,039 INFO L513 BasicCegarLoop]: trace histogram [231, 231, 230, 230, 230, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:40,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:40,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:40,253 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1371456098, now seen corresponding path program 18 times [2021-08-30 17:43:40,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:40,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361116358] [2021-08-30 17:43:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:40,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:43:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:43:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:43:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:43:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:43:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 138692 backedges. 43478 proven. 978 refuted. 0 times theorem prover too weak. 94236 trivial. 0 not checked. [2021-08-30 17:43:41,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:41,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361116358] [2021-08-30 17:43:41,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361116358] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:41,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360602759] [2021-08-30 17:43:41,168 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:43:41,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:41,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:41,177 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:41,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-30 17:43:42,611 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2021-08-30 17:43:42,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:42,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 2528 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-30 17:43:42,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:42,650 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:43:42,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:43:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 138692 backedges. 40458 proven. 3088 refuted. 0 times theorem prover too weak. 95146 trivial. 0 not checked. [2021-08-30 17:43:47,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 138692 backedges. 40348 proven. 3198 refuted. 0 times theorem prover too weak. 95146 trivial. 0 not checked. [2021-08-30 17:43:51,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360602759] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:51,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:51,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 30, 29] total 100 [2021-08-30 17:43:51,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790755384] [2021-08-30 17:43:51,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2021-08-30 17:43:51,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:51,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2021-08-30 17:43:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1449, Invalid=8451, Unknown=0, NotChecked=0, Total=9900 [2021-08-30 17:43:51,848 INFO L87 Difference]: Start difference. First operand 1122 states and 1146 transitions. Second operand has 100 states, 100 states have (on average 4.62) internal successors, (462), 97 states have internal predecessors, (462), 25 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 24 states have call predecessors, (24), 22 states have call successors, (24) [2021-08-30 17:43:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:59,856 INFO L93 Difference]: Finished difference Result 1377 states and 1405 transitions. [2021-08-30 17:43:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2021-08-30 17:43:59,857 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 4.62) internal successors, (462), 97 states have internal predecessors, (462), 25 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 24 states have call predecessors, (24), 22 states have call successors, (24) Word has length 1371 [2021-08-30 17:43:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:59,860 INFO L225 Difference]: With dead ends: 1377 [2021-08-30 17:43:59,860 INFO L226 Difference]: Without dead ends: 1368 [2021-08-30 17:43:59,863 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3079 GetRequests, 2786 SyntacticMatches, 36 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23662 ImplicationChecksByTransitivity, 9812.60ms TimeCoverageRelationStatistics Valid=10993, Invalid=55829, Unknown=0, NotChecked=0, Total=66822 [2021-08-30 17:43:59,863 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 1554 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 601.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 5281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.40ms SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3392 IncrementalHoareTripleChecker+Unchecked, 716.89ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:59,863 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1554 Valid, 165 Invalid, 5281 Unknown, 0 Unchecked, 8.40ms Time], IncrementalHoareTripleChecker [191 Valid, 1698 Invalid, 0 Unknown, 3392 Unchecked, 716.89ms Time] [2021-08-30 17:43:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2021-08-30 17:43:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1241. [2021-08-30 17:43:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1192 states have (on average 1.011744966442953) internal successors, (1206), 1197 states have internal predecessors, (1206), 26 states have call successors, (26), 19 states have call predecessors, (26), 22 states have return successors, (34), 24 states have call predecessors, (34), 25 states have call successors, (34) [2021-08-30 17:43:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1266 transitions. [2021-08-30 17:43:59,880 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1266 transitions. Word has length 1371 [2021-08-30 17:43:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:59,881 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1266 transitions. [2021-08-30 17:43:59,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 4.62) internal successors, (462), 97 states have internal predecessors, (462), 25 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 24 states have call predecessors, (24), 22 states have call successors, (24) [2021-08-30 17:43:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1266 transitions. [2021-08-30 17:43:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1382 [2021-08-30 17:43:59,895 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:59,896 INFO L513 BasicCegarLoop]: trace histogram [233, 233, 232, 232, 232, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:59,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:00,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-08-30 17:44:00,121 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1886527460, now seen corresponding path program 19 times [2021-08-30 17:44:00,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:00,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422784416] [2021-08-30 17:44:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:00,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:00,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:44:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:01,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1155 [2021-08-30 17:44:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 141041 backedges. 42846 proven. 2990 refuted. 0 times theorem prover too weak. 95205 trivial. 0 not checked. [2021-08-30 17:44:01,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:01,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422784416] [2021-08-30 17:44:01,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422784416] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:01,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15863224] [2021-08-30 17:44:01,120 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:44:01,120 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:01,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:01,120 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:44:01,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-30 17:44:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:01,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 3476 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-30 17:44:01,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:44:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 141041 backedges. 60202 proven. 946 refuted. 0 times theorem prover too weak. 79893 trivial. 0 not checked. [2021-08-30 17:44:03,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:44:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 141041 backedges. 42942 proven. 2894 refuted. 0 times theorem prover too weak. 95205 trivial. 0 not checked. [2021-08-30 17:44:06,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15863224] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:44:06,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:44:06,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41, 41] total 84 [2021-08-30 17:44:06,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868189069] [2021-08-30 17:44:06,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2021-08-30 17:44:06,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:44:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-08-30 17:44:06,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1577, Invalid=5395, Unknown=0, NotChecked=0, Total=6972 [2021-08-30 17:44:06,064 INFO L87 Difference]: Start difference. First operand 1241 states and 1266 transitions. Second operand has 84 states, 84 states have (on average 5.035714285714286) internal successors, (423), 83 states have internal predecessors, (423), 21 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2021-08-30 17:44:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:44:07,687 INFO L93 Difference]: Finished difference Result 1241 states and 1265 transitions. [2021-08-30 17:44:07,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-08-30 17:44:07,688 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 5.035714285714286) internal successors, (423), 83 states have internal predecessors, (423), 21 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 1381 [2021-08-30 17:44:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:44:07,692 INFO L225 Difference]: With dead ends: 1241 [2021-08-30 17:44:07,693 INFO L226 Difference]: Without dead ends: 1241 [2021-08-30 17:44:07,694 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2881 GetRequests, 2759 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4199 ImplicationChecksByTransitivity, 2141.94ms TimeCoverageRelationStatistics Valid=3664, Invalid=11098, Unknown=0, NotChecked=0, Total=14762 [2021-08-30 17:44:07,695 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 156 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 581.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.45ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 710.53ms IncrementalHoareTripleChecker+Time [2021-08-30 17:44:07,695 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 44 Invalid, 1929 Unknown, 0 Unchecked, 4.45ms Time], IncrementalHoareTripleChecker [46 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 710.53ms Time] [2021-08-30 17:44:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-08-30 17:44:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2021-08-30 17:44:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1192 states have (on average 1.011744966442953) internal successors, (1206), 1197 states have internal predecessors, (1206), 26 states have call successors, (26), 19 states have call predecessors, (26), 22 states have return successors, (33), 24 states have call predecessors, (33), 25 states have call successors, (33) [2021-08-30 17:44:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1265 transitions. [2021-08-30 17:44:07,712 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1265 transitions. Word has length 1381 [2021-08-30 17:44:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:44:07,712 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1265 transitions. [2021-08-30 17:44:07,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 5.035714285714286) internal successors, (423), 83 states have internal predecessors, (423), 21 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2021-08-30 17:44:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1265 transitions. [2021-08-30 17:44:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2021-08-30 17:44:07,728 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:44:07,729 INFO L513 BasicCegarLoop]: trace histogram [252, 252, 251, 251, 251, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:44:07,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:07,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-08-30 17:44:07,953 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:07,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1087238145, now seen corresponding path program 20 times [2021-08-30 17:44:07,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:07,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750268176] [2021-08-30 17:44:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:07,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:44:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:44:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:44:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 164818 backedges. 48992 proven. 1080 refuted. 0 times theorem prover too weak. 114746 trivial. 0 not checked. [2021-08-30 17:44:09,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:09,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750268176] [2021-08-30 17:44:09,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750268176] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:09,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078313636] [2021-08-30 17:44:09,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:44:09,058 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:09,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:09,059 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:44:09,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-08-30 17:44:09,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:44:09,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:44:09,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 3737 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-30 17:44:09,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:44:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 164818 backedges. 49102 proven. 970 refuted. 0 times theorem prover too weak. 114746 trivial. 0 not checked. [2021-08-30 17:44:12,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:44:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 164818 backedges. 49102 proven. 970 refuted. 0 times theorem prover too weak. 114746 trivial. 0 not checked. [2021-08-30 17:44:15,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078313636] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:44:15,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:44:15,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2021-08-30 17:44:15,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005761086] [2021-08-30 17:44:15,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2021-08-30 17:44:15,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:44:15,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-08-30 17:44:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1708, Invalid=5948, Unknown=0, NotChecked=0, Total=7656 [2021-08-30 17:44:15,028 INFO L87 Difference]: Start difference. First operand 1241 states and 1265 transitions. Second operand has 88 states, 88 states have (on average 4.943181818181818) internal successors, (435), 87 states have internal predecessors, (435), 23 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-08-30 17:44:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:44:16,782 INFO L93 Difference]: Finished difference Result 1268 states and 1292 transitions. [2021-08-30 17:44:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-30 17:44:16,783 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 4.943181818181818) internal successors, (435), 87 states have internal predecessors, (435), 23 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 1487 [2021-08-30 17:44:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:44:16,788 INFO L225 Difference]: With dead ends: 1268 [2021-08-30 17:44:16,788 INFO L226 Difference]: Without dead ends: 1262 [2021-08-30 17:44:16,790 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3103 GetRequests, 2971 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2707.45ms TimeCoverageRelationStatistics Valid=4195, Invalid=13097, Unknown=0, NotChecked=0, Total=17292 [2021-08-30 17:44:16,790 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 647 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 678.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.19ms SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 810.27ms IncrementalHoareTripleChecker+Time [2021-08-30 17:44:16,790 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 126 Invalid, 2250 Unknown, 0 Unchecked, 6.19ms Time], IncrementalHoareTripleChecker [104 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 810.27ms Time] [2021-08-30 17:44:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2021-08-30 17:44:16,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1246. [2021-08-30 17:44:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1197 states have (on average 1.0108604845446951) internal successors, (1210), 1202 states have internal predecessors, (1210), 26 states have call successors, (26), 19 states have call predecessors, (26), 22 states have return successors, (33), 24 states have call predecessors, (33), 25 states have call successors, (33) [2021-08-30 17:44:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1269 transitions. [2021-08-30 17:44:16,806 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1269 transitions. Word has length 1487 [2021-08-30 17:44:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:44:16,807 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 1269 transitions. [2021-08-30 17:44:16,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 4.943181818181818) internal successors, (435), 87 states have internal predecessors, (435), 23 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-08-30 17:44:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1269 transitions. [2021-08-30 17:44:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2021-08-30 17:44:16,823 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:44:16,823 INFO L513 BasicCegarLoop]: trace histogram [253, 253, 252, 252, 252, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:44:16,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:17,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-08-30 17:44:17,045 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:17,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:17,045 INFO L82 PathProgramCache]: Analyzing trace with hash -612079994, now seen corresponding path program 21 times [2021-08-30 17:44:17,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:17,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090103622] [2021-08-30 17:44:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:17,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:18,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:44:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:44:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:44:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 166096 backedges. 27585 proven. 1286 refuted. 0 times theorem prover too weak. 137225 trivial. 0 not checked. [2021-08-30 17:44:18,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:18,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090103622] [2021-08-30 17:44:18,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090103622] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:18,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823010880] [2021-08-30 17:44:18,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:44:18,093 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:18,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:18,097 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:44:18,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-08-30 17:44:18,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-08-30 17:44:18,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:44:18,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-30 17:44:18,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:44:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 166096 backedges. 48082 proven. 3425 refuted. 0 times theorem prover too weak. 114589 trivial. 0 not checked. [2021-08-30 17:44:22,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:44:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 166096 backedges. 48082 proven. 3425 refuted. 0 times theorem prover too weak. 114589 trivial. 0 not checked. [2021-08-30 17:44:25,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823010880] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:44:25,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:44:25,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 51, 51] total 117 [2021-08-30 17:44:25,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013122292] [2021-08-30 17:44:25,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2021-08-30 17:44:25,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:44:25,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2021-08-30 17:44:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=11609, Unknown=0, NotChecked=0, Total=13572 [2021-08-30 17:44:25,709 INFO L87 Difference]: Start difference. First operand 1246 states and 1269 transitions. Second operand has 117 states, 117 states have (on average 4.854700854700854) internal successors, (568), 115 states have internal predecessors, (568), 22 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 21 states have call predecessors, (23), 21 states have call successors, (23) [2021-08-30 17:44:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:44:29,841 INFO L93 Difference]: Finished difference Result 1387 states and 1410 transitions. [2021-08-30 17:44:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-08-30 17:44:29,842 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 4.854700854700854) internal successors, (568), 115 states have internal predecessors, (568), 22 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 21 states have call predecessors, (23), 21 states have call successors, (23) Word has length 1492 [2021-08-30 17:44:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:44:29,845 INFO L225 Difference]: With dead ends: 1387 [2021-08-30 17:44:29,845 INFO L226 Difference]: Without dead ends: 1387 [2021-08-30 17:44:29,848 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3164 GetRequests, 2955 SyntacticMatches, 3 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11917 ImplicationChecksByTransitivity, 5575.62ms TimeCoverageRelationStatistics Valid=7805, Invalid=35251, Unknown=0, NotChecked=0, Total=43056 [2021-08-30 17:44:29,848 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 1821 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 3190 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1078.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.51ms SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 3190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1283.88ms IncrementalHoareTripleChecker+Time [2021-08-30 17:44:29,848 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1823 Valid, 63 Invalid, 3623 Unknown, 0 Unchecked, 10.51ms Time], IncrementalHoareTripleChecker [433 Valid, 3190 Invalid, 0 Unknown, 0 Unchecked, 1283.88ms Time] [2021-08-30 17:44:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2021-08-30 17:44:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1378. [2021-08-30 17:44:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1325 states have (on average 1.009811320754717) internal successors, (1338), 1332 states have internal predecessors, (1338), 27 states have call successors, (27), 20 states have call predecessors, (27), 25 states have return successors, (36), 25 states have call predecessors, (36), 26 states have call successors, (36) [2021-08-30 17:44:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1401 transitions. [2021-08-30 17:44:29,866 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1401 transitions. Word has length 1492 [2021-08-30 17:44:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:44:29,867 INFO L470 AbstractCegarLoop]: Abstraction has 1378 states and 1401 transitions. [2021-08-30 17:44:29,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 4.854700854700854) internal successors, (568), 115 states have internal predecessors, (568), 22 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 21 states have call predecessors, (23), 21 states have call successors, (23) [2021-08-30 17:44:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1401 transitions. [2021-08-30 17:44:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1614 [2021-08-30 17:44:29,885 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:44:29,886 INFO L513 BasicCegarLoop]: trace histogram [275, 275, 274, 274, 274, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:44:29,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:30,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-08-30 17:44:30,109 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1280506436, now seen corresponding path program 22 times [2021-08-30 17:44:30,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:30,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009403627] [2021-08-30 17:44:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:30,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:44:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:44:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:44:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:44:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 195975 backedges. 28980 proven. 1221 refuted. 0 times theorem prover too weak. 165774 trivial. 0 not checked. [2021-08-30 17:44:31,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:31,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009403627] [2021-08-30 17:44:31,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009403627] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:31,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966228018] [2021-08-30 17:44:31,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:44:31,087 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:31,089 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:44:31,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-08-30 17:44:34,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:44:34,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:44:34,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 4046 conjuncts, 69 conjunts are in the unsatisfiable core [2021-08-30 17:44:34,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:44:34,384 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:44:34,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:44:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 195975 backedges. 28773 proven. 4344 refuted. 0 times theorem prover too weak. 162858 trivial. 0 not checked. [2021-08-30 17:44:39,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:44:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 195975 backedges. 28777 proven. 4340 refuted. 0 times theorem prover too weak. 162858 trivial. 0 not checked. [2021-08-30 17:44:42,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966228018] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:44:42,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:44:42,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 29] total 82 [2021-08-30 17:44:42,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140925674] [2021-08-30 17:44:42,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2021-08-30 17:44:42,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:44:42,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-08-30 17:44:42,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=5601, Unknown=0, NotChecked=0, Total=6806 [2021-08-30 17:44:42,289 INFO L87 Difference]: Start difference. First operand 1378 states and 1401 transitions. Second operand has 83 states, 82 states have (on average 4.841463414634147) internal successors, (397), 80 states have internal predecessors, (397), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-30 17:44:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:44:45,094 INFO L93 Difference]: Finished difference Result 1463 states and 1496 transitions. [2021-08-30 17:44:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-30 17:44:45,094 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 4.841463414634147) internal successors, (397), 80 states have internal predecessors, (397), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 1613 [2021-08-30 17:44:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:44:45,098 INFO L225 Difference]: With dead ends: 1463 [2021-08-30 17:44:45,098 INFO L226 Difference]: Without dead ends: 1463 [2021-08-30 17:44:45,099 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3360 GetRequests, 3205 SyntacticMatches, 41 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4215 ImplicationChecksByTransitivity, 3051.27ms TimeCoverageRelationStatistics Valid=2481, Invalid=10859, Unknown=0, NotChecked=0, Total=13340 [2021-08-30 17:44:45,099 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 768 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 5140 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1291.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.25ms SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 5140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 914 IncrementalHoareTripleChecker+Unchecked, 1550.51ms IncrementalHoareTripleChecker+Time [2021-08-30 17:44:45,099 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 101 Invalid, 6147 Unknown, 0 Unchecked, 11.25ms Time], IncrementalHoareTripleChecker [93 Valid, 5140 Invalid, 0 Unknown, 914 Unchecked, 1550.51ms Time] [2021-08-30 17:44:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-08-30 17:44:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1428. [2021-08-30 17:44:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1375 states have (on average 1.0167272727272727) internal successors, (1398), 1382 states have internal predecessors, (1398), 27 states have call successors, (27), 20 states have call predecessors, (27), 25 states have return successors, (36), 25 states have call predecessors, (36), 26 states have call successors, (36) [2021-08-30 17:44:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1461 transitions. [2021-08-30 17:44:45,116 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1461 transitions. Word has length 1613 [2021-08-30 17:44:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:44:45,117 INFO L470 AbstractCegarLoop]: Abstraction has 1428 states and 1461 transitions. [2021-08-30 17:44:45,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 4.841463414634147) internal successors, (397), 80 states have internal predecessors, (397), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-30 17:44:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1461 transitions. [2021-08-30 17:44:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1664 [2021-08-30 17:44:45,136 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:44:45,137 INFO L513 BasicCegarLoop]: trace histogram [285, 285, 284, 284, 284, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:44:45,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:45,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:45,359 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1384112612, now seen corresponding path program 23 times [2021-08-30 17:44:45,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:45,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637157597] [2021-08-30 17:44:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:45,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:44:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:44:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:44:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:44:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 210140 backedges. 43097 proven. 2373 refuted. 0 times theorem prover too weak. 164670 trivial. 0 not checked. [2021-08-30 17:44:46,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:46,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637157597] [2021-08-30 17:44:46,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637157597] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:46,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185178595] [2021-08-30 17:44:46,622 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:44:46,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:46,625 INFO L229 MonitoredProcess]: Starting monitored process 44 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:44:46,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-08-30 17:44:57,477 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2021-08-30 17:44:57,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:44:57,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 56 conjunts are in the unsatisfiable core [2021-08-30 17:44:57,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:45:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 210140 backedges. 44008 proven. 6963 refuted. 0 times theorem prover too weak. 159169 trivial. 0 not checked. [2021-08-30 17:45:00,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:45:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 210140 backedges. 43215 proven. 7756 refuted. 0 times theorem prover too weak. 159169 trivial. 0 not checked. [2021-08-30 17:45:03,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185178595] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:45:03,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:45:03,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 56, 56] total 95 [2021-08-30 17:45:03,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22307423] [2021-08-30 17:45:03,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2021-08-30 17:45:03,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:45:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2021-08-30 17:45:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1624, Invalid=7306, Unknown=0, NotChecked=0, Total=8930 [2021-08-30 17:45:03,190 INFO L87 Difference]: Start difference. First operand 1428 states and 1461 transitions. Second operand has 95 states, 95 states have (on average 4.757894736842105) internal successors, (452), 92 states have internal predecessors, (452), 25 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2021-08-30 17:45:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:45:07,839 INFO L93 Difference]: Finished difference Result 1976 states and 2023 transitions. [2021-08-30 17:45:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2021-08-30 17:45:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 4.757894736842105) internal successors, (452), 92 states have internal predecessors, (452), 25 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) Word has length 1663 [2021-08-30 17:45:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:45:07,843 INFO L225 Difference]: With dead ends: 1976 [2021-08-30 17:45:07,843 INFO L226 Difference]: Without dead ends: 1976 [2021-08-30 17:45:07,846 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3547 GetRequests, 3325 SyntacticMatches, 2 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14802 ImplicationChecksByTransitivity, 5185.75ms TimeCoverageRelationStatistics Valid=8685, Invalid=40377, Unknown=0, NotChecked=0, Total=49062 [2021-08-30 17:45:07,846 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 902 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 985.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.69ms SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1180.74ms IncrementalHoareTripleChecker+Time [2021-08-30 17:45:07,846 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 63 Invalid, 3304 Unknown, 0 Unchecked, 8.69ms Time], IncrementalHoareTripleChecker [218 Valid, 3086 Invalid, 0 Unknown, 0 Unchecked, 1180.74ms Time] [2021-08-30 17:45:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2021-08-30 17:45:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1962. [2021-08-30 17:45:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1894 states have (on average 1.0163674762407604) internal successors, (1925), 1905 states have internal predecessors, (1925), 34 states have call successors, (34), 24 states have call predecessors, (34), 33 states have return successors, (50), 32 states have call predecessors, (50), 33 states have call successors, (50) [2021-08-30 17:45:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2009 transitions. [2021-08-30 17:45:07,866 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2009 transitions. Word has length 1663 [2021-08-30 17:45:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:45:07,867 INFO L470 AbstractCegarLoop]: Abstraction has 1962 states and 2009 transitions. [2021-08-30 17:45:07,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 4.757894736842105) internal successors, (452), 92 states have internal predecessors, (452), 25 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2021-08-30 17:45:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2009 transitions. [2021-08-30 17:45:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2012 [2021-08-30 17:45:07,894 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:45:07,895 INFO L513 BasicCegarLoop]: trace histogram [348, 348, 347, 347, 347, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:45:07,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-08-30 17:45:08,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-08-30 17:45:08,121 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:45:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:45:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1316052493, now seen corresponding path program 24 times [2021-08-30 17:45:08,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:45:08,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192178234] [2021-08-30 17:45:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:45:08,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:45:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:45:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:45:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:45:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:45:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:45:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:45:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:45:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:45:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:45:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:45:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:45:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:45:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:45:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:45:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:45:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:45:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:45:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:45:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:45:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:45:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:45:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:45:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1493 [2021-08-30 17:45:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:09,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1609 [2021-08-30 17:45:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1725 [2021-08-30 17:45:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 312656 backedges. 107789 proven. 8137 refuted. 0 times theorem prover too weak. 196730 trivial. 0 not checked. [2021-08-30 17:45:09,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:45:09,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192178234] [2021-08-30 17:45:09,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192178234] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:45:09,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106620624] [2021-08-30 17:45:09,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:45:09,650 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:45:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:45:09,651 INFO L229 MonitoredProcess]: Starting monitored process 45 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:45:09,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-08-30 17:45:14,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2021-08-30 17:45:14,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:45:14,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 4040 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-30 17:45:14,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:45:14,993 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:45:14,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:45:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 312656 backedges. 81803 proven. 4860 refuted. 0 times theorem prover too weak. 225993 trivial. 0 not checked. [2021-08-30 17:45:22,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:45:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 312656 backedges. 81663 proven. 5000 refuted. 0 times theorem prover too weak. 225993 trivial. 0 not checked. [2021-08-30 17:45:28,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106620624] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:45:28,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:45:28,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 34, 32] total 115 [2021-08-30 17:45:28,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997958572] [2021-08-30 17:45:28,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2021-08-30 17:45:28,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:45:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2021-08-30 17:45:28,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1872, Invalid=11238, Unknown=0, NotChecked=0, Total=13110 [2021-08-30 17:45:28,012 INFO L87 Difference]: Start difference. First operand 1962 states and 2009 transitions. Second operand has 115 states, 115 states have (on average 4.608695652173913) internal successors, (530), 112 states have internal predecessors, (530), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 17:45:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:45:37,623 INFO L93 Difference]: Finished difference Result 2478 states and 2545 transitions. [2021-08-30 17:45:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2021-08-30 17:45:37,623 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 4.608695652173913) internal successors, (530), 112 states have internal predecessors, (530), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 2011 [2021-08-30 17:45:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:45:37,628 INFO L225 Difference]: With dead ends: 2478 [2021-08-30 17:45:37,628 INFO L226 Difference]: Without dead ends: 2338 [2021-08-30 17:45:37,632 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4348 GetRequests, 3995 SyntacticMatches, 84 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27157 ImplicationChecksByTransitivity, 12083.64ms TimeCoverageRelationStatistics Valid=11257, Invalid=61913, Unknown=0, NotChecked=0, Total=73170 [2021-08-30 17:45:37,632 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 2804 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1088.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2822 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 6867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.30ms SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3085 IncrementalHoareTripleChecker+Unchecked, 1346.88ms IncrementalHoareTripleChecker+Time [2021-08-30 17:45:37,632 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2822 Valid, 64 Invalid, 6867 Unknown, 0 Unchecked, 13.30ms Time], IncrementalHoareTripleChecker [183 Valid, 3599 Invalid, 0 Unknown, 3085 Unchecked, 1346.88ms Time] [2021-08-30 17:45:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2021-08-30 17:45:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2236. [2021-08-30 17:45:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2164 states have (on average 1.0157116451016637) internal successors, (2198), 2176 states have internal predecessors, (2198), 35 states have call successors, (35), 26 states have call predecessors, (35), 36 states have return successors, (51), 33 states have call predecessors, (51), 34 states have call successors, (51) [2021-08-30 17:45:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2284 transitions. [2021-08-30 17:45:37,655 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2284 transitions. Word has length 2011 [2021-08-30 17:45:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:45:37,656 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2284 transitions. [2021-08-30 17:45:37,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 4.608695652173913) internal successors, (530), 112 states have internal predecessors, (530), 7 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 17:45:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2284 transitions. [2021-08-30 17:45:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2037 [2021-08-30 17:45:37,684 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:45:37,685 INFO L513 BasicCegarLoop]: trace histogram [353, 353, 352, 352, 352, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:45:37,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2021-08-30 17:45:37,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:45:37,909 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:45:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:45:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1434080096, now seen corresponding path program 25 times [2021-08-30 17:45:37,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:45:37,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815007413] [2021-08-30 17:45:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:45:37,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:45:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:45:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:45:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:45:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:45:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:45:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:45:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:45:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:45:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:45:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:45:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:45:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:45:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:45:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:45:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:45:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:45:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:45:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:45:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:45:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:45:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:45:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:45:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:45:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1619 [2021-08-30 17:45:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1745 [2021-08-30 17:45:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 321516 backedges. 115461 proven. 6552 refuted. 0 times theorem prover too weak. 199503 trivial. 0 not checked. [2021-08-30 17:45:39,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:45:39,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815007413] [2021-08-30 17:45:39,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815007413] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:45:39,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040173083] [2021-08-30 17:45:39,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:45:39,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:45:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:45:39,489 INFO L229 MonitoredProcess]: Starting monitored process 46 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:45:39,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-08-30 17:45:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:40,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 5081 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-30 17:45:40,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:45:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 321516 backedges. 140414 proven. 1177 refuted. 0 times theorem prover too weak. 179925 trivial. 0 not checked. [2021-08-30 17:45:43,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:45:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 321516 backedges. 83180 proven. 6335 refuted. 0 times theorem prover too weak. 232001 trivial. 0 not checked. [2021-08-30 17:45:47,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040173083] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:45:47,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:45:47,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 48, 48] total 122 [2021-08-30 17:45:47,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824851720] [2021-08-30 17:45:47,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2021-08-30 17:45:47,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:45:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2021-08-30 17:45:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=12402, Unknown=0, NotChecked=0, Total=14762 [2021-08-30 17:45:47,714 INFO L87 Difference]: Start difference. First operand 2236 states and 2284 transitions. Second operand has 122 states, 122 states have (on average 4.950819672131147) internal successors, (604), 121 states have internal predecessors, (604), 25 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) [2021-08-30 17:45:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:45:51,159 INFO L93 Difference]: Finished difference Result 1836 states and 1866 transitions. [2021-08-30 17:45:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-08-30 17:45:51,160 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 122 states have (on average 4.950819672131147) internal successors, (604), 121 states have internal predecessors, (604), 25 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) Word has length 2036 [2021-08-30 17:45:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:45:51,165 INFO L225 Difference]: With dead ends: 1836 [2021-08-30 17:45:51,166 INFO L226 Difference]: Without dead ends: 1815 [2021-08-30 17:45:51,168 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4246 GetRequests, 4054 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10969 ImplicationChecksByTransitivity, 4286.13ms TimeCoverageRelationStatistics Valid=6350, Invalid=31092, Unknown=0, NotChecked=0, Total=37442 [2021-08-30 17:45:51,169 INFO L928 BasicCegarLoop]: 26 mSDtfsCounter, 1431 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 6280 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1578.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 6450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.06ms SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 6280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1922.20ms IncrementalHoareTripleChecker+Time [2021-08-30 17:45:51,169 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1432 Valid, 207 Invalid, 6450 Unknown, 0 Unchecked, 15.06ms Time], IncrementalHoareTripleChecker [170 Valid, 6280 Invalid, 0 Unknown, 0 Unchecked, 1922.20ms Time] [2021-08-30 17:45:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2021-08-30 17:45:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1815. [2021-08-30 17:45:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1758 states have (on average 1.0113765642775883) internal successors, (1778), 1763 states have internal predecessors, (1778), 30 states have call successors, (30), 23 states have call predecessors, (30), 26 states have return successors, (37), 28 states have call predecessors, (37), 29 states have call successors, (37) [2021-08-30 17:45:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 1845 transitions. [2021-08-30 17:45:51,187 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 1845 transitions. Word has length 2036 [2021-08-30 17:45:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:45:51,188 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 1845 transitions. [2021-08-30 17:45:51,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 4.950819672131147) internal successors, (604), 121 states have internal predecessors, (604), 25 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) [2021-08-30 17:45:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 1845 transitions. [2021-08-30 17:45:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2052 [2021-08-30 17:45:51,215 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:45:51,216 INFO L513 BasicCegarLoop]: trace histogram [356, 356, 355, 355, 355, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:45:51,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2021-08-30 17:45:51,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-08-30 17:45:51,433 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:45:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:45:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 622695105, now seen corresponding path program 26 times [2021-08-30 17:45:51,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:45:51,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282254363] [2021-08-30 17:45:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:45:51,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:45:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:45:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:45:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:45:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:45:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:45:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:45:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:45:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:45:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:45:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:45:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:45:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:45:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:45:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:45:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:45:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:45:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:45:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:45:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:45:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:45:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:45:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:45:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:45:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:45:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:52,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:45:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 326892 backedges. 91858 proven. 1538 refuted. 0 times theorem prover too weak. 233496 trivial. 0 not checked. [2021-08-30 17:45:53,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:45:53,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282254363] [2021-08-30 17:45:53,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282254363] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:45:53,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568369589] [2021-08-30 17:45:53,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:45:53,060 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:45:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:45:53,061 INFO L229 MonitoredProcess]: Starting monitored process 47 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:45:53,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-08-30 17:45:53,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:45:53,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:45:53,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 5117 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-30 17:45:53,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:45:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 326892 backedges. 91992 proven. 1404 refuted. 0 times theorem prover too weak. 233496 trivial. 0 not checked. [2021-08-30 17:45:57,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:46:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 326892 backedges. 91992 proven. 1404 refuted. 0 times theorem prover too weak. 233496 trivial. 0 not checked. [2021-08-30 17:46:00,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568369589] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:46:00,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:46:00,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2021-08-30 17:46:00,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115773742] [2021-08-30 17:46:00,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-08-30 17:46:00,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:46:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-08-30 17:46:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2382, Invalid=8330, Unknown=0, NotChecked=0, Total=10712 [2021-08-30 17:46:00,929 INFO L87 Difference]: Start difference. First operand 1815 states and 1845 transitions. Second operand has 104 states, 104 states have (on average 4.951923076923077) internal successors, (515), 103 states have internal predecessors, (515), 27 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-08-30 17:46:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:46:02,987 INFO L93 Difference]: Finished difference Result 1824 states and 1852 transitions. [2021-08-30 17:46:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-30 17:46:02,987 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 4.951923076923077) internal successors, (515), 103 states have internal predecessors, (515), 27 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Word has length 2051 [2021-08-30 17:46:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:46:02,992 INFO L225 Difference]: With dead ends: 1824 [2021-08-30 17:46:02,993 INFO L226 Difference]: Without dead ends: 1818 [2021-08-30 17:46:02,995 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4255 GetRequests, 4099 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6110 ImplicationChecksByTransitivity, 3604.43ms TimeCoverageRelationStatistics Valid=5841, Invalid=18339, Unknown=0, NotChecked=0, Total=24180 [2021-08-30 17:46:02,995 INFO L928 BasicCegarLoop]: 28 mSDtfsCounter, 716 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 687.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.54ms SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 828.47ms IncrementalHoareTripleChecker+Time [2021-08-30 17:46:02,996 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 188 Invalid, 2415 Unknown, 0 Unchecked, 6.54ms Time], IncrementalHoareTripleChecker [109 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 828.47ms Time] [2021-08-30 17:46:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2021-08-30 17:46:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1815. [2021-08-30 17:46:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1758 states have (on average 1.0102389078498293) internal successors, (1776), 1763 states have internal predecessors, (1776), 30 states have call successors, (30), 23 states have call predecessors, (30), 26 states have return successors, (37), 28 states have call predecessors, (37), 29 states have call successors, (37) [2021-08-30 17:46:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 1843 transitions. [2021-08-30 17:46:03,019 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 1843 transitions. Word has length 2051 [2021-08-30 17:46:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:46:03,020 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 1843 transitions. [2021-08-30 17:46:03,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 4.951923076923077) internal successors, (515), 103 states have internal predecessors, (515), 27 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-08-30 17:46:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 1843 transitions. [2021-08-30 17:46:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2057 [2021-08-30 17:46:03,077 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:46:03,077 INFO L513 BasicCegarLoop]: trace histogram [357, 357, 356, 356, 356, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:46:03,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2021-08-30 17:46:03,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:03,293 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:46:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:46:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 381333830, now seen corresponding path program 27 times [2021-08-30 17:46:03,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:46:03,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924155405] [2021-08-30 17:46:03,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:46:03,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:46:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:46:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:46:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:46:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:46:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:46:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:46:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:46:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:46:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:46:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:46:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:46:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:46:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:46:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:46:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:46:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:46:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:46:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:46:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:46:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:46:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:46:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:46:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:46:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:46:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:46:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 328694 backedges. 55292 proven. 2529 refuted. 0 times theorem prover too weak. 270873 trivial. 0 not checked. [2021-08-30 17:46:04,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:46:04,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924155405] [2021-08-30 17:46:04,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924155405] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:46:04,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610214030] [2021-08-30 17:46:04,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:46:04,894 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:04,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:46:04,894 INFO L229 MonitoredProcess]: Starting monitored process 48 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:46:04,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-08-30 17:46:06,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2021-08-30 17:46:06,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:46:06,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 46 conjunts are in the unsatisfiable core [2021-08-30 17:46:06,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:46:06,334 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:46:06,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:46:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 328694 backedges. 83842 proven. 8472 refuted. 0 times theorem prover too weak. 236380 trivial. 0 not checked. [2021-08-30 17:46:14,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:46:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 328694 backedges. 83574 proven. 8740 refuted. 0 times theorem prover too weak. 236380 trivial. 0 not checked. [2021-08-30 17:46:20,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610214030] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:46:20,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:46:20,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 36, 35] total 126 [2021-08-30 17:46:20,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340669262] [2021-08-30 17:46:20,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2021-08-30 17:46:20,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:46:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2021-08-30 17:46:20,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1948, Invalid=13802, Unknown=0, NotChecked=0, Total=15750 [2021-08-30 17:46:20,066 INFO L87 Difference]: Start difference. First operand 1815 states and 1843 transitions. Second operand has 126 states, 126 states have (on average 4.595238095238095) internal successors, (579), 122 states have internal predecessors, (579), 32 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (31), 31 states have call predecessors, (31), 29 states have call successors, (31) [2021-08-30 17:46:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:46:29,212 INFO L93 Difference]: Finished difference Result 2132 states and 2169 transitions. [2021-08-30 17:46:29,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2021-08-30 17:46:29,213 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 4.595238095238095) internal successors, (579), 122 states have internal predecessors, (579), 32 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (31), 31 states have call predecessors, (31), 29 states have call successors, (31) Word has length 2056 [2021-08-30 17:46:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:46:29,217 INFO L225 Difference]: With dead ends: 2132 [2021-08-30 17:46:29,217 INFO L226 Difference]: Without dead ends: 2132 [2021-08-30 17:46:29,220 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4428 GetRequests, 4103 SyntacticMatches, 58 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27508 ImplicationChecksByTransitivity, 12288.51ms TimeCoverageRelationStatistics Valid=11167, Invalid=60925, Unknown=0, NotChecked=0, Total=72092 [2021-08-30 17:46:29,221 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 1274 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 746.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.41ms SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1599 IncrementalHoareTripleChecker+Unchecked, 896.84ms IncrementalHoareTripleChecker+Time [2021-08-30 17:46:29,221 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1274 Valid, 81 Invalid, 4051 Unknown, 0 Unchecked, 8.41ms Time], IncrementalHoareTripleChecker [270 Valid, 2182 Invalid, 0 Unknown, 1599 Unchecked, 896.84ms Time] [2021-08-30 17:46:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2021-08-30 17:46:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2092. [2021-08-30 17:46:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2031 states have (on average 1.0098473658296405) internal successors, (2051), 2036 states have internal predecessors, (2051), 32 states have call successors, (32), 25 states have call predecessors, (32), 28 states have return successors, (39), 30 states have call predecessors, (39), 31 states have call successors, (39) [2021-08-30 17:46:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2122 transitions. [2021-08-30 17:46:29,238 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2122 transitions. Word has length 2056 [2021-08-30 17:46:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:46:29,239 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 2122 transitions. [2021-08-30 17:46:29,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 4.595238095238095) internal successors, (579), 122 states have internal predecessors, (579), 32 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (31), 31 states have call predecessors, (31), 29 states have call successors, (31) [2021-08-30 17:46:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2122 transitions. [2021-08-30 17:46:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2329 [2021-08-30 17:46:29,273 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:46:29,273 INFO L513 BasicCegarLoop]: trace histogram [407, 407, 406, 406, 406, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:46:29,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-08-30 17:46:29,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:29,474 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:46:29,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:46:29,475 INFO L82 PathProgramCache]: Analyzing trace with hash -326933952, now seen corresponding path program 28 times [2021-08-30 17:46:29,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:46:29,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388653836] [2021-08-30 17:46:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:46:29,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:46:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:46:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:46:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:46:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:46:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:46:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:46:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:46:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:46:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:46:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:46:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:46:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:46:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:46:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:46:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:46:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:46:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:46:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:46:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:46:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:46:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:46:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:46:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:46:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:46:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:46:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:46:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2027 [2021-08-30 17:46:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 426528 backedges. 146588 proven. 4825 refuted. 0 times theorem prover too weak. 275115 trivial. 0 not checked. [2021-08-30 17:46:31,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:46:31,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388653836] [2021-08-30 17:46:31,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388653836] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:46:31,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311613420] [2021-08-30 17:46:31,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:46:31,125 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:31,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:46:31,126 INFO L229 MonitoredProcess]: Starting monitored process 49 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:46:31,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-08-30 17:46:31,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:46:31,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:46:31,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 4886 conjuncts, 58 conjunts are in the unsatisfiable core [2021-08-30 17:46:31,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:46:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 426528 backedges. 145697 proven. 5492 refuted. 0 times theorem prover too weak. 275339 trivial. 0 not checked. [2021-08-30 17:46:36,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:46:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 426528 backedges. 105088 proven. 8946 refuted. 0 times theorem prover too weak. 312494 trivial. 0 not checked. [2021-08-30 17:46:40,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311613420] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:46:40,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:46:40,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 57, 57] total 139 [2021-08-30 17:46:40,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165619304] [2021-08-30 17:46:40,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2021-08-30 17:46:40,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:46:40,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2021-08-30 17:46:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3041, Invalid=16141, Unknown=0, NotChecked=0, Total=19182 [2021-08-30 17:46:40,686 INFO L87 Difference]: Start difference. First operand 2092 states and 2122 transitions. Second operand has 139 states, 139 states have (on average 4.9352517985611515) internal successors, (686), 138 states have internal predecessors, (686), 26 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 26 states have call predecessors, (30), 26 states have call successors, (30) [2021-08-30 17:46:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:46:44,695 INFO L93 Difference]: Finished difference Result 2119 states and 2147 transitions. [2021-08-30 17:46:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-08-30 17:46:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 4.9352517985611515) internal successors, (686), 138 states have internal predecessors, (686), 26 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 26 states have call predecessors, (30), 26 states have call successors, (30) Word has length 2328 [2021-08-30 17:46:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:46:44,701 INFO L225 Difference]: With dead ends: 2119 [2021-08-30 17:46:44,701 INFO L226 Difference]: Without dead ends: 2096 [2021-08-30 17:46:44,704 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4845 GetRequests, 4627 SyntacticMatches, 2 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14300 ImplicationChecksByTransitivity, 5308.56ms TimeCoverageRelationStatistics Valid=8314, Invalid=38992, Unknown=0, NotChecked=0, Total=47306 [2021-08-30 17:46:44,705 INFO L928 BasicCegarLoop]: 28 mSDtfsCounter, 1484 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 7276 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1792.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.45ms SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 7276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2171.22ms IncrementalHoareTripleChecker+Time [2021-08-30 17:46:44,705 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 156 Invalid, 7450 Unknown, 0 Unchecked, 17.45ms Time], IncrementalHoareTripleChecker [174 Valid, 7276 Invalid, 0 Unknown, 0 Unchecked, 2171.22ms Time] [2021-08-30 17:46:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2021-08-30 17:46:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2092. [2021-08-30 17:46:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2031 states have (on average 1.0083702609551946) internal successors, (2048), 2036 states have internal predecessors, (2048), 32 states have call successors, (32), 25 states have call predecessors, (32), 28 states have return successors, (39), 30 states have call predecessors, (39), 31 states have call successors, (39) [2021-08-30 17:46:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2119 transitions. [2021-08-30 17:46:44,726 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2119 transitions. Word has length 2328 [2021-08-30 17:46:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:46:44,727 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 2119 transitions. [2021-08-30 17:46:44,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 4.9352517985611515) internal successors, (686), 138 states have internal predecessors, (686), 26 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 26 states have call predecessors, (30), 26 states have call successors, (30) [2021-08-30 17:46:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2119 transitions. [2021-08-30 17:46:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2339 [2021-08-30 17:46:44,780 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:46:44,781 INFO L513 BasicCegarLoop]: trace histogram [409, 409, 408, 408, 408, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:46:44,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-08-30 17:46:44,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-08-30 17:46:44,996 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:46:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:46:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash -437774842, now seen corresponding path program 29 times [2021-08-30 17:46:44,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:46:44,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666861172] [2021-08-30 17:46:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:46:44,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:46:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:46:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:46:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:46:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:46:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:46:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:46:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:46:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:46:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:46:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:46:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:46:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:46:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:46:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:46:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:46:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:46:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:46:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:46:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:46:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:46:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:46:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:46:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:46:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:46:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:46:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:46:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:46,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:46:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 430651 backedges. 110628 proven. 1797 refuted. 0 times theorem prover too weak. 318226 trivial. 0 not checked. [2021-08-30 17:46:46,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:46:46,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666861172] [2021-08-30 17:46:46,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666861172] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:46:46,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145250281] [2021-08-30 17:46:46,644 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:46:46,644 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:46:46,645 INFO L229 MonitoredProcess]: Starting monitored process 50 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:46:46,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-08-30 17:47:25,163 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2021-08-30 17:47:25,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:47:25,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 5756 conjuncts, 60 conjunts are in the unsatisfiable core [2021-08-30 17:47:25,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:47:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 430651 backedges. 114300 proven. 20826 refuted. 0 times theorem prover too weak. 295525 trivial. 0 not checked. [2021-08-30 17:47:29,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:47:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 430651 backedges. 114338 proven. 20788 refuted. 0 times theorem prover too weak. 295525 trivial. 0 not checked. [2021-08-30 17:47:34,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145250281] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:47:34,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:47:34,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 60, 60] total 140 [2021-08-30 17:47:34,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153221288] [2021-08-30 17:47:34,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2021-08-30 17:47:34,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:47:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2021-08-30 17:47:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3133, Invalid=16327, Unknown=0, NotChecked=0, Total=19460 [2021-08-30 17:47:34,922 INFO L87 Difference]: Start difference. First operand 2092 states and 2119 transitions. Second operand has 140 states, 140 states have (on average 4.9) internal successors, (686), 139 states have internal predecessors, (686), 28 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-08-30 17:47:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:47:39,002 INFO L93 Difference]: Finished difference Result 2107 states and 2133 transitions. [2021-08-30 17:47:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-08-30 17:47:39,002 INFO L78 Accepts]: Start accepts. Automaton has has 140 states, 140 states have (on average 4.9) internal successors, (686), 139 states have internal predecessors, (686), 28 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Word has length 2338 [2021-08-30 17:47:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:47:39,007 INFO L225 Difference]: With dead ends: 2107 [2021-08-30 17:47:39,007 INFO L226 Difference]: Without dead ends: 2101 [2021-08-30 17:47:39,010 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4857 GetRequests, 4645 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12130 ImplicationChecksByTransitivity, 6118.07ms TimeCoverageRelationStatistics Valid=9043, Invalid=35689, Unknown=0, NotChecked=0, Total=44732 [2021-08-30 17:47:39,010 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 1753 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 5556 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1495.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.65ms SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 5556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1820.06ms IncrementalHoareTripleChecker+Time [2021-08-30 17:47:39,010 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1754 Valid, 217 Invalid, 5830 Unknown, 0 Unchecked, 14.65ms Time], IncrementalHoareTripleChecker [274 Valid, 5556 Invalid, 0 Unknown, 0 Unchecked, 1820.06ms Time] [2021-08-30 17:47:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2021-08-30 17:47:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2097. [2021-08-30 17:47:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2036 states have (on average 1.0078585461689586) internal successors, (2052), 2041 states have internal predecessors, (2052), 32 states have call successors, (32), 25 states have call predecessors, (32), 28 states have return successors, (39), 30 states have call predecessors, (39), 31 states have call successors, (39) [2021-08-30 17:47:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2123 transitions. [2021-08-30 17:47:39,027 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2123 transitions. Word has length 2338 [2021-08-30 17:47:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:47:39,028 INFO L470 AbstractCegarLoop]: Abstraction has 2097 states and 2123 transitions. [2021-08-30 17:47:39,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 140 states, 140 states have (on average 4.9) internal successors, (686), 139 states have internal predecessors, (686), 28 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-08-30 17:47:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2123 transitions. [2021-08-30 17:47:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2344 [2021-08-30 17:47:39,058 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:47:39,059 INFO L513 BasicCegarLoop]: trace histogram [410, 410, 409, 409, 409, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:47:39,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2021-08-30 17:47:39,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-08-30 17:47:39,268 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:47:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:47:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1153986849, now seen corresponding path program 30 times [2021-08-30 17:47:39,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:47:39,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543783041] [2021-08-30 17:47:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:47:39,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:47:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:47:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:47:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:47:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:47:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:47:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:47:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:47:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:47:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:47:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:47:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:47:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:47:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:47:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:47:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:47:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:47:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:47:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:47:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:47:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:47:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:47:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:47:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:47:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:47:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:47:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:47:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:47:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 432720 backedges. 64262 proven. 2613 refuted. 0 times theorem prover too weak. 365845 trivial. 0 not checked. [2021-08-30 17:47:40,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:47:40,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543783041] [2021-08-30 17:47:40,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543783041] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:47:40,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529120187] [2021-08-30 17:47:40,867 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:47:40,867 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:47:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:47:40,868 INFO L229 MonitoredProcess]: Starting monitored process 51 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:47:40,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-08-30 17:48:09,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2021-08-30 17:48:09,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:48:09,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 4247 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-30 17:48:09,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:48:09,123 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:48:09,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:48:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 432720 backedges. 66472 proven. 22429 refuted. 0 times theorem prover too weak. 343819 trivial. 0 not checked. [2021-08-30 17:48:17,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:48:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 432720 backedges. 65452 proven. 23449 refuted. 0 times theorem prover too weak. 343819 trivial. 0 not checked. [2021-08-30 17:48:24,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529120187] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:48:24,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:48:24,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 38, 37] total 134 [2021-08-30 17:48:24,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280543925] [2021-08-30 17:48:24,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2021-08-30 17:48:24,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:48:24,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2021-08-30 17:48:24,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1983, Invalid=15839, Unknown=0, NotChecked=0, Total=17822 [2021-08-30 17:48:24,244 INFO L87 Difference]: Start difference. First operand 2097 states and 2123 transitions. Second operand has 134 states, 134 states have (on average 4.619402985074627) internal successors, (619), 130 states have internal predecessors, (619), 60 states have call successors, (62), 6 states have call predecessors, (62), 4 states have return successors, (59), 59 states have call predecessors, (59), 57 states have call successors, (59) [2021-08-30 17:48:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:48:30,342 INFO L93 Difference]: Finished difference Result 2441 states and 2478 transitions. [2021-08-30 17:48:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2021-08-30 17:48:30,342 INFO L78 Accepts]: Start accepts. Automaton has has 134 states, 134 states have (on average 4.619402985074627) internal successors, (619), 130 states have internal predecessors, (619), 60 states have call successors, (62), 6 states have call predecessors, (62), 4 states have return successors, (59), 59 states have call predecessors, (59), 57 states have call successors, (59) Word has length 2343 [2021-08-30 17:48:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:48:30,347 INFO L225 Difference]: With dead ends: 2441 [2021-08-30 17:48:30,347 INFO L226 Difference]: Without dead ends: 2441 [2021-08-30 17:48:30,351 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4949 GetRequests, 4656 SyntacticMatches, 50 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24759 ImplicationChecksByTransitivity, 9670.14ms TimeCoverageRelationStatistics Valid=7372, Invalid=52408, Unknown=0, NotChecked=0, Total=59780 [2021-08-30 17:48:30,351 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 999 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 832.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.12ms SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1204 IncrementalHoareTripleChecker+Unchecked, 988.39ms IncrementalHoareTripleChecker+Time [2021-08-30 17:48:30,351 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1001 Valid, 60 Invalid, 3746 Unknown, 0 Unchecked, 8.12ms Time], IncrementalHoareTripleChecker [315 Valid, 2227 Invalid, 0 Unknown, 1204 Unchecked, 988.39ms Time] [2021-08-30 17:48:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2021-08-30 17:48:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2414. [2021-08-30 17:48:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2347 states have (on average 1.0076693651469961) internal successors, (2365), 2351 states have internal predecessors, (2365), 37 states have call successors, (37), 27 states have call predecessors, (37), 29 states have return successors, (44), 35 states have call predecessors, (44), 36 states have call successors, (44) [2021-08-30 17:48:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2446 transitions. [2021-08-30 17:48:30,372 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2446 transitions. Word has length 2343 [2021-08-30 17:48:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:48:30,373 INFO L470 AbstractCegarLoop]: Abstraction has 2414 states and 2446 transitions. [2021-08-30 17:48:30,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 4.619402985074627) internal successors, (619), 130 states have internal predecessors, (619), 60 states have call successors, (62), 6 states have call predecessors, (62), 4 states have return successors, (59), 59 states have call predecessors, (59), 57 states have call successors, (59) [2021-08-30 17:48:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2446 transitions. [2021-08-30 17:48:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3074 [2021-08-30 17:48:30,432 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:48:30,433 INFO L513 BasicCegarLoop]: trace histogram [545, 545, 544, 544, 544, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:48:30,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2021-08-30 17:48:30,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-08-30 17:48:30,649 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:48:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:48:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1231499534, now seen corresponding path program 31 times [2021-08-30 17:48:30,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:48:30,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687900396] [2021-08-30 17:48:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:48:30,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:48:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:48:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:48:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:48:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:48:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:48:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:48:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:48:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:48:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:48:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:48:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:48:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:48:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:48:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:48:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:48:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:48:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:48:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:48:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:48:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:48:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:48:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:48:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:48:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:48:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:48:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:48:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:48:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2178 [2021-08-30 17:48:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2324 [2021-08-30 17:48:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2470 [2021-08-30 17:48:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2616 [2021-08-30 17:48:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2762 [2021-08-30 17:48:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 762215 backedges. 212893 proven. 5616 refuted. 0 times theorem prover too weak. 543706 trivial. 0 not checked. [2021-08-30 17:48:32,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:48:32,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687900396] [2021-08-30 17:48:32,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687900396] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:48:32,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634870846] [2021-08-30 17:48:32,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:48:32,782 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:48:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:48:32,784 INFO L229 MonitoredProcess]: Starting monitored process 52 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:48:32,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-08-30 17:48:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:33,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 7616 conjuncts, 58 conjunts are in the unsatisfiable core [2021-08-30 17:48:33,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:48:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 762215 backedges. 344872 proven. 1782 refuted. 0 times theorem prover too weak. 415561 trivial. 0 not checked. [2021-08-30 17:48:39,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:48:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 762215 backedges. 139380 proven. 16594 refuted. 0 times theorem prover too weak. 606241 trivial. 0 not checked. [2021-08-30 17:48:44,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634870846] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:48:44,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:48:44,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 58, 58] total 144 [2021-08-30 17:48:44,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791896586] [2021-08-30 17:48:44,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2021-08-30 17:48:44,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:48:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2021-08-30 17:48:44,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3368, Invalid=17224, Unknown=0, NotChecked=0, Total=20592 [2021-08-30 17:48:44,449 INFO L87 Difference]: Start difference. First operand 2414 states and 2446 transitions. Second operand has 144 states, 144 states have (on average 4.979166666666667) internal successors, (717), 143 states have internal predecessors, (717), 29 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (32), 28 states have call predecessors, (32), 29 states have call successors, (32) [2021-08-30 17:48:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:48:48,937 INFO L93 Difference]: Finished difference Result 2432 states and 2463 transitions. [2021-08-30 17:48:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-08-30 17:48:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 144 states, 144 states have (on average 4.979166666666667) internal successors, (717), 143 states have internal predecessors, (717), 29 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (32), 28 states have call predecessors, (32), 29 states have call successors, (32) Word has length 3073 [2021-08-30 17:48:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:48:48,943 INFO L225 Difference]: With dead ends: 2432 [2021-08-30 17:48:48,943 INFO L226 Difference]: Without dead ends: 2426 [2021-08-30 17:48:48,946 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6354 GetRequests, 6126 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15518 ImplicationChecksByTransitivity, 5759.17ms TimeCoverageRelationStatistics Valid=8904, Invalid=42852, Unknown=0, NotChecked=0, Total=51756 [2021-08-30 17:48:48,947 INFO L928 BasicCegarLoop]: 30 mSDtfsCounter, 1444 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 8339 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2102.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 8586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.59ms SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 8339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2542.84ms IncrementalHoareTripleChecker+Time [2021-08-30 17:48:48,947 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1445 Valid, 220 Invalid, 8586 Unknown, 0 Unchecked, 18.59ms Time], IncrementalHoareTripleChecker [247 Valid, 8339 Invalid, 0 Unknown, 0 Unchecked, 2542.84ms Time] [2021-08-30 17:48:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2021-08-30 17:48:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2419. [2021-08-30 17:48:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2352 states have (on average 1.0068027210884354) internal successors, (2368), 2356 states have internal predecessors, (2368), 37 states have call successors, (37), 27 states have call predecessors, (37), 29 states have return successors, (44), 35 states have call predecessors, (44), 36 states have call successors, (44) [2021-08-30 17:48:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 2449 transitions. [2021-08-30 17:48:48,964 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 2449 transitions. Word has length 3073 [2021-08-30 17:48:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:48:48,965 INFO L470 AbstractCegarLoop]: Abstraction has 2419 states and 2449 transitions. [2021-08-30 17:48:48,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 4.979166666666667) internal successors, (717), 143 states have internal predecessors, (717), 29 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (32), 28 states have call predecessors, (32), 29 states have call successors, (32) [2021-08-30 17:48:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2449 transitions. [2021-08-30 17:48:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3099 [2021-08-30 17:48:49,013 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:48:49,014 INFO L513 BasicCegarLoop]: trace histogram [550, 550, 549, 549, 549, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:48:49,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2021-08-30 17:48:49,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-08-30 17:48:49,214 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:48:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:48:49,215 INFO L82 PathProgramCache]: Analyzing trace with hash -376079319, now seen corresponding path program 32 times [2021-08-30 17:48:49,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:48:49,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759343813] [2021-08-30 17:48:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:48:49,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:48:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:48:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:48:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:48:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:48:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:48:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:48:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:48:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:48:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:48:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:48:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:48:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:48:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:48:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:48:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:48:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:48:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:48:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:48:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:48:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:48:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:48:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:48:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:48:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:48:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:48:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:48:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:48:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2178 [2021-08-30 17:48:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2329 [2021-08-30 17:48:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2480 [2021-08-30 17:48:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2631 [2021-08-30 17:48:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:50,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2782 [2021-08-30 17:48:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 776035 backedges. 219323 proven. 6034 refuted. 0 times theorem prover too weak. 550678 trivial. 0 not checked. [2021-08-30 17:48:51,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:48:51,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759343813] [2021-08-30 17:48:51,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759343813] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:48:51,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739686488] [2021-08-30 17:48:51,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:48:51,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:48:51,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:48:51,393 INFO L229 MonitoredProcess]: Starting monitored process 53 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:48:51,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-08-30 17:48:52,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:48:52,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:48:52,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 7676 conjuncts, 60 conjunts are in the unsatisfiable core [2021-08-30 17:48:52,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:48:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 776035 backedges. 318247 proven. 1918 refuted. 0 times theorem prover too weak. 455870 trivial. 0 not checked. [2021-08-30 17:48:58,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:49:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 776035 backedges. 146110 proven. 13858 refuted. 0 times theorem prover too weak. 616067 trivial. 0 not checked. [2021-08-30 17:49:03,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739686488] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:49:03,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:49:03,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 60, 60] total 149 [2021-08-30 17:49:03,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958412583] [2021-08-30 17:49:03,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2021-08-30 17:49:03,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:49:03,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2021-08-30 17:49:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3604, Invalid=18448, Unknown=0, NotChecked=0, Total=22052 [2021-08-30 17:49:03,561 INFO L87 Difference]: Start difference. First operand 2419 states and 2449 transitions. Second operand has 149 states, 149 states have (on average 4.97986577181208) internal successors, (742), 148 states have internal predecessors, (742), 30 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (33), 29 states have call predecessors, (33), 30 states have call successors, (33) [2021-08-30 17:49:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:49:08,202 INFO L93 Difference]: Finished difference Result 2440 states and 2470 transitions. [2021-08-30 17:49:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-08-30 17:49:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 4.97986577181208) internal successors, (742), 148 states have internal predecessors, (742), 30 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (33), 29 states have call predecessors, (33), 30 states have call successors, (33) Word has length 3098 [2021-08-30 17:49:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:49:08,207 INFO L225 Difference]: With dead ends: 2440 [2021-08-30 17:49:08,207 INFO L226 Difference]: Without dead ends: 2423 [2021-08-30 17:49:08,211 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6409 GetRequests, 6173 SyntacticMatches, 2 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16685 ImplicationChecksByTransitivity, 6130.98ms TimeCoverageRelationStatistics Valid=9526, Invalid=45934, Unknown=0, NotChecked=0, Total=55460 [2021-08-30 17:49:08,211 INFO L928 BasicCegarLoop]: 31 mSDtfsCounter, 1293 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 8880 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2150.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 9034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.58ms SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 8880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2605.19ms IncrementalHoareTripleChecker+Time [2021-08-30 17:49:08,212 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 211 Invalid, 9034 Unknown, 0 Unchecked, 19.58ms Time], IncrementalHoareTripleChecker [154 Valid, 8880 Invalid, 0 Unknown, 0 Unchecked, 2605.19ms Time] [2021-08-30 17:49:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2021-08-30 17:49:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2419. [2021-08-30 17:49:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2352 states have (on average 1.005952380952381) internal successors, (2366), 2356 states have internal predecessors, (2366), 37 states have call successors, (37), 27 states have call predecessors, (37), 29 states have return successors, (44), 35 states have call predecessors, (44), 36 states have call successors, (44) [2021-08-30 17:49:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 2447 transitions. [2021-08-30 17:49:08,227 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 2447 transitions. Word has length 3098 [2021-08-30 17:49:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:49:08,228 INFO L470 AbstractCegarLoop]: Abstraction has 2419 states and 2447 transitions. [2021-08-30 17:49:08,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 4.97986577181208) internal successors, (742), 148 states have internal predecessors, (742), 30 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (33), 29 states have call predecessors, (33), 30 states have call successors, (33) [2021-08-30 17:49:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2447 transitions. [2021-08-30 17:49:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3119 [2021-08-30 17:49:08,275 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:49:08,276 INFO L513 BasicCegarLoop]: trace histogram [554, 554, 553, 553, 553, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:49:08,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2021-08-30 17:49:08,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-08-30 17:49:08,477 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:49:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:49:08,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1978839069, now seen corresponding path program 33 times [2021-08-30 17:49:08,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:49:08,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664536172] [2021-08-30 17:49:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:49:08,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:49:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:49:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:49:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:49:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:49:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:49:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:49:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:49:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:49:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:49:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:49:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:49:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:49:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:49:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:49:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:49:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:49:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:49:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:49:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:49:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:49:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:49:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:49:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:49:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:49:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:49:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:49:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:49:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2178 [2021-08-30 17:49:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2329 [2021-08-30 17:49:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2485 [2021-08-30 17:49:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2641 [2021-08-30 17:49:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2797 [2021-08-30 17:49:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 787181 backedges. 225363 proven. 6467 refuted. 0 times theorem prover too weak. 555351 trivial. 0 not checked. [2021-08-30 17:49:10,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:49:10,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664536172] [2021-08-30 17:49:10,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664536172] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:49:10,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953806407] [2021-08-30 17:49:10,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:49:10,681 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:49:10,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:49:10,682 INFO L229 MonitoredProcess]: Starting monitored process 54 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:49:10,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-08-30 17:49:12,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2021-08-30 17:49:12,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:49:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 3155 conjuncts, 50 conjunts are in the unsatisfiable core [2021-08-30 17:49:12,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:49:12,935 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 17:49:12,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-08-30 17:49:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 787181 backedges. 154221 proven. 6883 refuted. 0 times theorem prover too weak. 626077 trivial. 0 not checked. [2021-08-30 17:49:23,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:49:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 787181 backedges. 154039 proven. 7065 refuted. 0 times theorem prover too weak. 626077 trivial. 0 not checked. [2021-08-30 17:49:31,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953806407] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:49:31,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:49:31,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 40, 39] total 144 [2021-08-30 17:49:31,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653387918] [2021-08-30 17:49:31,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2021-08-30 17:49:31,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:49:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2021-08-30 17:49:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3077, Invalid=17515, Unknown=0, NotChecked=0, Total=20592 [2021-08-30 17:49:31,704 INFO L87 Difference]: Start difference. First operand 2419 states and 2447 transitions. Second operand has 144 states, 144 states have (on average 4.722222222222222) internal successors, (680), 141 states have internal predecessors, (680), 7 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-30 17:49:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:49:41,778 INFO L93 Difference]: Finished difference Result 2899 states and 2932 transitions. [2021-08-30 17:49:41,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2021-08-30 17:49:41,779 INFO L78 Accepts]: Start accepts. Automaton has has 144 states, 144 states have (on average 4.722222222222222) internal successors, (680), 141 states have internal predecessors, (680), 7 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 3118 [2021-08-30 17:49:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:49:41,783 INFO L225 Difference]: With dead ends: 2899 [2021-08-30 17:49:41,783 INFO L226 Difference]: Without dead ends: 2896 [2021-08-30 17:49:41,788 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6678 GetRequests, 6279 SyntacticMatches, 94 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34627 ImplicationChecksByTransitivity, 14456.74ms TimeCoverageRelationStatistics Valid=14897, Invalid=79045, Unknown=0, NotChecked=0, Total=93942 [2021-08-30 17:49:41,788 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 3087 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 4284 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1298.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3114 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.70ms SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 4284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2784 IncrementalHoareTripleChecker+Unchecked, 1543.73ms IncrementalHoareTripleChecker+Time [2021-08-30 17:49:41,789 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3114 Valid, 62 Invalid, 7335 Unknown, 0 Unchecked, 15.70ms Time], IncrementalHoareTripleChecker [267 Valid, 4284 Invalid, 0 Unknown, 2784 Unchecked, 1543.73ms Time] [2021-08-30 17:49:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2021-08-30 17:49:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2588. [2021-08-30 17:49:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2588 states, 2518 states have (on average 1.0059571088165211) internal successors, (2533), 2523 states have internal predecessors, (2533), 38 states have call successors, (38), 28 states have call predecessors, (38), 31 states have return successors, (46), 36 states have call predecessors, (46), 37 states have call successors, (46) [2021-08-30 17:49:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 2617 transitions. [2021-08-30 17:49:41,809 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 2617 transitions. Word has length 3118 [2021-08-30 17:49:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:49:41,811 INFO L470 AbstractCegarLoop]: Abstraction has 2588 states and 2617 transitions. [2021-08-30 17:49:41,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 4.722222222222222) internal successors, (680), 141 states have internal predecessors, (680), 7 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-30 17:49:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 2617 transitions. [2021-08-30 17:49:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3134 [2021-08-30 17:49:41,870 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:49:41,871 INFO L513 BasicCegarLoop]: trace histogram [557, 557, 556, 556, 556, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:49:41,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2021-08-30 17:49:42,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-08-30 17:49:42,092 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:49:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:49:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1245208932, now seen corresponding path program 34 times [2021-08-30 17:49:42,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:49:42,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609337673] [2021-08-30 17:49:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:49:42,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:49:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:49:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:49:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:49:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:49:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:49:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:49:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:49:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:49:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:49:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:49:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:49:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:49:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:49:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:49:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:49:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:49:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:49:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:49:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:49:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:49:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:49:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:49:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:49:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:49:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:49:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:42,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:49:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:49:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2178 [2021-08-30 17:49:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2329 [2021-08-30 17:49:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2485 [2021-08-30 17:49:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2646 [2021-08-30 17:49:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2807 [2021-08-30 17:49:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:49:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 795593 backedges. 230983 proven. 6915 refuted. 0 times theorem prover too weak. 557695 trivial. 0 not checked. [2021-08-30 17:49:44,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:49:44,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609337673] [2021-08-30 17:49:44,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609337673] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:49:44,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924057930] [2021-08-30 17:49:44,399 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:49:44,399 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:49:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:49:44,400 INFO L229 MonitoredProcess]: Starting monitored process 55 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:49:44,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-08-30 17:49:45,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:49:45,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:49:45,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 6536 conjuncts, 68 conjunts are in the unsatisfiable core [2021-08-30 17:49:45,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:49:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 795593 backedges. 230747 proven. 7797 refuted. 0 times theorem prover too weak. 557049 trivial. 0 not checked. [2021-08-30 17:49:51,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:49:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 795593 backedges. 160033 proven. 12691 refuted. 0 times theorem prover too weak. 622869 trivial. 0 not checked. [2021-08-30 17:49:56,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924057930] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:49:56,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:49:56,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 67, 67] total 164 [2021-08-30 17:49:56,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405593356] [2021-08-30 17:49:56,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 164 states [2021-08-30 17:49:56,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:49:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2021-08-30 17:49:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4241, Invalid=22491, Unknown=0, NotChecked=0, Total=26732 [2021-08-30 17:49:56,922 INFO L87 Difference]: Start difference. First operand 2588 states and 2617 transitions. Second operand has 164 states, 164 states have (on average 4.945121951219512) internal successors, (811), 163 states have internal predecessors, (811), 31 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 31 states have call predecessors, (35), 31 states have call successors, (35) [2021-08-30 17:50:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:50:01,758 INFO L93 Difference]: Finished difference Result 2763 states and 2794 transitions. [2021-08-30 17:50:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2021-08-30 17:50:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 164 states, 164 states have (on average 4.945121951219512) internal successors, (811), 163 states have internal predecessors, (811), 31 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 31 states have call predecessors, (35), 31 states have call successors, (35) Word has length 3133 [2021-08-30 17:50:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:50:01,764 INFO L225 Difference]: With dead ends: 2763 [2021-08-30 17:50:01,764 INFO L226 Difference]: Without dead ends: 2760 [2021-08-30 17:50:01,771 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6490 GetRequests, 6232 SyntacticMatches, 2 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20310 ImplicationChecksByTransitivity, 7050.48ms TimeCoverageRelationStatistics Valid=11534, Invalid=54772, Unknown=0, NotChecked=0, Total=66306 [2021-08-30 17:50:01,772 INFO L928 BasicCegarLoop]: 33 mSDtfsCounter, 1845 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 7666 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1977.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.72ms SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 7666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2384.48ms IncrementalHoareTripleChecker+Time [2021-08-30 17:50:01,772 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 130 Invalid, 7918 Unknown, 0 Unchecked, 18.72ms Time], IncrementalHoareTripleChecker [252 Valid, 7666 Invalid, 0 Unknown, 0 Unchecked, 2384.48ms Time] [2021-08-30 17:50:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2021-08-30 17:50:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2740. [2021-08-30 17:50:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2670 states have (on average 1.0052434456928838) internal successors, (2684), 2674 states have internal predecessors, (2684), 38 states have call successors, (38), 29 states have call predecessors, (38), 31 states have return successors, (46), 36 states have call predecessors, (46), 37 states have call successors, (46) [2021-08-30 17:50:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 2768 transitions. [2021-08-30 17:50:01,796 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 2768 transitions. Word has length 3133 [2021-08-30 17:50:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:50:01,797 INFO L470 AbstractCegarLoop]: Abstraction has 2740 states and 2768 transitions. [2021-08-30 17:50:01,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 164 states, 164 states have (on average 4.945121951219512) internal successors, (811), 163 states have internal predecessors, (811), 31 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 31 states have call predecessors, (35), 31 states have call successors, (35) [2021-08-30 17:50:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 2768 transitions. [2021-08-30 17:50:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3144 [2021-08-30 17:50:01,889 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:50:01,890 INFO L513 BasicCegarLoop]: trace histogram [559, 559, 558, 558, 558, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:50:01,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2021-08-30 17:50:02,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:50:02,101 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:50:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:50:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2065956834, now seen corresponding path program 35 times [2021-08-30 17:50:02,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:50:02,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682380497] [2021-08-30 17:50:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:50:02,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:50:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:50:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:50:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:50:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:50:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:50:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:50:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:50:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:50:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:50:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:50:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:50:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:50:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:50:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:50:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:50:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:50:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:50:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:50:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:50:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:50:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:50:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:50:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:50:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:50:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:50:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:50:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:50:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2178 [2021-08-30 17:50:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2329 [2021-08-30 17:50:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2485 [2021-08-30 17:50:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2646 [2021-08-30 17:50:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2812 [2021-08-30 17:50:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:50:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 801226 backedges. 167738 proven. 2532 refuted. 0 times theorem prover too weak. 630956 trivial. 0 not checked. [2021-08-30 17:50:04,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:50:04,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682380497] [2021-08-30 17:50:04,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682380497] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:50:04,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562954158] [2021-08-30 17:50:04,282 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:50:04,282 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:50:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:50:04,282 INFO L229 MonitoredProcess]: Starting monitored process 56 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:50:04,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-08-30 17:51:51,766 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2021-08-30 17:51:51,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:51:51,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 7721 conjuncts, 70 conjunts are in the unsatisfiable core [2021-08-30 17:51:51,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:51:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 801226 backedges. 167370 proven. 15932 refuted. 0 times theorem prover too weak. 617924 trivial. 0 not checked. [2021-08-30 17:51:57,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:52:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 801226 backedges. 167384 proven. 15918 refuted. 0 times theorem prover too weak. 617924 trivial. 0 not checked. [2021-08-30 17:52:03,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562954158] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:52:03,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:52:03,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 70, 70] total 144 [2021-08-30 17:52:03,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97747842] [2021-08-30 17:52:03,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2021-08-30 17:52:03,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:52:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2021-08-30 17:52:03,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3940, Invalid=16652, Unknown=0, NotChecked=0, Total=20592 [2021-08-30 17:52:03,410 INFO L87 Difference]: Start difference. First operand 2740 states and 2768 transitions. Second operand has 144 states, 144 states have (on average 4.902777777777778) internal successors, (706), 143 states have internal predecessors, (706), 33 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2021-08-30 17:52:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:52:07,893 INFO L93 Difference]: Finished difference Result 2774 states and 2808 transitions. [2021-08-30 17:52:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-08-30 17:52:07,893 INFO L78 Accepts]: Start accepts. Automaton has has 144 states, 144 states have (on average 4.902777777777778) internal successors, (706), 143 states have internal predecessors, (706), 33 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) Word has length 3143 [2021-08-30 17:52:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:52:07,899 INFO L225 Difference]: With dead ends: 2774 [2021-08-30 17:52:07,900 INFO L226 Difference]: Without dead ends: 2774 [2021-08-30 17:52:07,903 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6489 GetRequests, 6271 SyntacticMatches, 2 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12430 ImplicationChecksByTransitivity, 6865.73ms TimeCoverageRelationStatistics Valid=10640, Invalid=36666, Unknown=0, NotChecked=0, Total=47306 [2021-08-30 17:52:07,904 INFO L928 BasicCegarLoop]: 34 mSDtfsCounter, 1827 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 5082 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1492.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 5325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.71ms SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 5082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1783.09ms IncrementalHoareTripleChecker+Time [2021-08-30 17:52:07,904 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1828 Valid, 182 Invalid, 5325 Unknown, 0 Unchecked, 12.71ms Time], IncrementalHoareTripleChecker [243 Valid, 5082 Invalid, 0 Unknown, 0 Unchecked, 1783.09ms Time] [2021-08-30 17:52:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2021-08-30 17:52:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2748. [2021-08-30 17:52:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 2677 states have (on average 1.0056032872618603) internal successors, (2692), 2682 states have internal predecessors, (2692), 38 states have call successors, (38), 29 states have call predecessors, (38), 32 states have return successors, (48), 36 states have call predecessors, (48), 37 states have call successors, (48) [2021-08-30 17:52:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 2778 transitions. [2021-08-30 17:52:07,925 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 2778 transitions. Word has length 3143 [2021-08-30 17:52:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:52:07,927 INFO L470 AbstractCegarLoop]: Abstraction has 2748 states and 2778 transitions. [2021-08-30 17:52:07,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 4.902777777777778) internal successors, (706), 143 states have internal predecessors, (706), 33 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2021-08-30 17:52:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 2778 transitions. [2021-08-30 17:52:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3149 [2021-08-30 17:52:07,979 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:52:07,980 INFO L513 BasicCegarLoop]: trace histogram [560, 560, 559, 559, 559, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:52:08,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2021-08-30 17:52:08,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:52:08,181 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:52:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:52:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2091587081, now seen corresponding path program 36 times [2021-08-30 17:52:08,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:52:08,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106329707] [2021-08-30 17:52:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:52:08,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:52:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:52:09,868 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 17:52:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:52:12,242 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 17:52:12,242 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 17:52:12,243 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location fooErr2REQUIRES_VIOLATION (7 of 8 remaining) [2021-08-30 17:52:12,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONARRAY_INDEX (6 of 8 remaining) [2021-08-30 17:52:12,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr1REQUIRES_VIOLATION (5 of 8 remaining) [2021-08-30 17:52:12,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (4 of 8 remaining) [2021-08-30 17:52:12,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (3 of 8 remaining) [2021-08-30 17:52:12,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION (2 of 8 remaining) [2021-08-30 17:52:12,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION (1 of 8 remaining) [2021-08-30 17:52:12,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ENSURES_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2021-08-30 17:52:12,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-30 17:52:12,253 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 17:52:12,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 05:52:12 BoogieIcfgContainer [2021-08-30 17:52:12,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 17:52:12,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 17:52:12,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 17:52:12,636 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 17:52:12,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:41:13" (3/4) ... [2021-08-30 17:52:12,638 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-30 17:52:13,014 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-30 17:52:13,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 17:52:13,015 INFO L158 Benchmark]: Toolchain (without parser) took 659872.81ms. Allocated memory was 67.1MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 47.7MB in the beginning and 554.3MB in the end (delta: -506.6MB). Peak memory consumption was 543.1MB. Max. memory is 16.1GB. [2021-08-30 17:52:13,015 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 67.1MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:52:13,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.67ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 38.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-30 17:52:13,015 INFO L158 Benchmark]: Boogie Preprocessor took 80.42ms. Allocated memory is still 67.1MB. Free memory was 38.5MB in the beginning and 50.9MB in the end (delta: -12.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-30 17:52:13,015 INFO L158 Benchmark]: RCFGBuilder took 250.90ms. Allocated memory is still 67.1MB. Free memory was 50.7MB in the beginning and 41.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-30 17:52:13,015 INFO L158 Benchmark]: TraceAbstraction took 658980.84ms. Allocated memory was 67.1MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 41.1MB in the beginning and 642.9MB in the end (delta: -601.8MB). Peak memory consumption was 817.9MB. Max. memory is 16.1GB. [2021-08-30 17:52:13,015 INFO L158 Benchmark]: Witness Printer took 378.80ms. Allocated memory is still 1.1GB. Free memory was 642.9MB in the beginning and 554.3MB in the end (delta: 88.6MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2021-08-30 17:52:13,016 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.43ms. Allocated memory is still 67.1MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.67ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 38.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.42ms. Allocated memory is still 67.1MB. Free memory was 38.5MB in the beginning and 50.9MB in the end (delta: -12.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 250.90ms. Allocated memory is still 67.1MB. Free memory was 50.7MB in the beginning and 41.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 658980.84ms. Allocated memory was 67.1MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 41.1MB in the beginning and 642.9MB in the end (delta: -601.8MB). Peak memory consumption was 817.9MB. Max. memory is 16.1GB. * Witness Printer took 378.80ms. Allocated memory is still 1.1GB. Free memory was 642.9MB in the beginning and 554.3MB in the end (delta: 88.6MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 18]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L24] int i, b[32]; [L25] char mask[32]; [L26] i = 0 VAL [b={34:0}, i=0, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=0, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=0, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L17] COND TRUE i <= size + 1 VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L18] EXPR a[i] VAL [\old(size)=0, b={33:0}, b={33:0}, i=0, size=0] [L18] EXPR b[i] VAL [\old(size)=0, b={33:0}, b={33:0}, b[i]=140, i=0, size=0] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=0, b={33:0}, b={33:0}, i=1, size=0] [L17] COND TRUE i <= size + 1 VAL [\old(size)=0, b={33:0}, b={33:0}, i=1, size=0] [L18] EXPR a[i] VAL [\old(size)=0, b={33:0}, b={33:0}, i=1, size=0] [L18] EXPR b[i] VAL [\old(size)=0, b={33:0}, b={33:0}, b[i]=138, i=1, size=0] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=0, b={33:0}, b={33:0}, i=2, size=0] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=0, b={33:0}, b={33:0}, i=2, size=0] [L20] return i; VAL [\old(size)=0, \result=2, b={33:0}, b={33:0}, i=2, size=0] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=2, i=0, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=2, i=0, mask={33:0}] [L26] i++ VAL [b={34:0}, i=1, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=1, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=1, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L17] COND TRUE i <= size + 1 VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR b[i] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=140, i=0, size=1] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L17] COND TRUE i <= size + 1 VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR b[i] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=138, i=1, size=1] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L17] COND TRUE i <= size + 1 VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L18] EXPR b[i] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=158, i=2, size=1] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=3, size=1] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=1, b={33:0}, b={33:0}, i=3, size=1] [L20] return i; VAL [\old(size)=1, \result=3, b={33:0}, b={33:0}, i=3, size=1] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=3, i=1, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=3, i=1, mask={33:0}] [L26] i++ VAL [b={34:0}, i=2, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=2, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=2, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L17] COND TRUE i <= size + 1 VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR b[i] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=140, i=0, size=2] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L17] COND TRUE i <= size + 1 VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR b[i] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=138, i=1, size=2] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L17] COND TRUE i <= size + 1 VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR b[i] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=158, i=2, size=2] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L17] COND TRUE i <= size + 1 VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L18] EXPR b[i] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=143, i=3, size=2] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=4, size=2] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=2, b={33:0}, b={33:0}, i=4, size=2] [L20] return i; VAL [\old(size)=2, \result=4, b={33:0}, b={33:0}, i=4, size=2] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=4, i=2, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=4, i=2, mask={33:0}] [L26] i++ VAL [b={34:0}, i=3, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=3, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=3, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L17] COND TRUE i <= size + 1 VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=140, i=0, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L17] COND TRUE i <= size + 1 VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=138, i=1, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L17] COND TRUE i <= size + 1 VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=158, i=2, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L17] COND TRUE i <= size + 1 VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=143, i=3, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L17] COND TRUE i <= size + 1 VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=142, i=4, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=5, size=3] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=3, b={33:0}, b={33:0}, i=5, size=3] [L20] return i; VAL [\old(size)=3, \result=5, b={33:0}, b={33:0}, i=5, size=3] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=5, i=3, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=5, i=3, mask={33:0}] [L26] i++ VAL [b={34:0}, i=4, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=4, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=4, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L17] COND TRUE i <= size + 1 VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=140, i=0, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L17] COND TRUE i <= size + 1 VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=138, i=1, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L17] COND TRUE i <= size + 1 VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=158, i=2, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L17] COND TRUE i <= size + 1 VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=143, i=3, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L17] COND TRUE i <= size + 1 VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=142, i=4, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L17] COND TRUE i <= size + 1 VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=152, i=5, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=6, size=4] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=4, b={33:0}, b={33:0}, i=6, size=4] [L20] return i; VAL [\old(size)=4, \result=6, b={33:0}, b={33:0}, i=6, size=4] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=6, i=4, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=6, i=4, mask={33:0}] [L26] i++ VAL [b={34:0}, i=5, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=5, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=5, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L17] COND TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=140, i=0, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L17] COND TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=138, i=1, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L17] COND TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=158, i=2, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L17] COND TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=143, i=3, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L17] COND TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=142, i=4, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L17] COND TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=152, i=5, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L17] COND TRUE i <= size + 1 VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=148, i=6, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=7, size=5] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=5, b={33:0}, b={33:0}, i=7, size=5] [L20] return i; VAL [\old(size)=5, \result=7, b={33:0}, b={33:0}, i=7, size=5] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=7, i=5, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=7, i=5, mask={33:0}] [L26] i++ VAL [b={34:0}, i=6, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=6, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=6, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=140, i=0, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=138, i=1, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=158, i=2, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=143, i=3, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=142, i=4, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=152, i=5, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=148, i=6, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L17] COND TRUE i <= size + 1 VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=133, i=7, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=8, size=6] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=6, b={33:0}, b={33:0}, i=8, size=6] [L20] return i; VAL [\old(size)=6, \result=8, b={33:0}, b={33:0}, i=8, size=6] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=8, i=6, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=8, i=6, mask={33:0}] [L26] i++ VAL [b={34:0}, i=7, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=7, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=7, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=140, i=0, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=138, i=1, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=158, i=2, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=143, i=3, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=142, i=4, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=152, i=5, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=148, i=6, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=133, i=7, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L17] COND TRUE i <= size + 1 VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=150, i=8, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=9, size=7] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=7, b={33:0}, b={33:0}, i=9, size=7] [L20] return i; VAL [\old(size)=7, \result=9, b={33:0}, b={33:0}, i=9, size=7] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=9, i=7, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=9, i=7, mask={33:0}] [L26] i++ VAL [b={34:0}, i=8, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=8, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=8, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=140, i=0, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=138, i=1, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=158, i=2, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=143, i=3, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=142, i=4, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=152, i=5, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=148, i=6, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=133, i=7, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=150, i=8, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L17] COND TRUE i <= size + 1 VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=162, i=9, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=10, size=8] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=8, b={33:0}, b={33:0}, i=10, size=8] [L20] return i; VAL [\old(size)=8, \result=10, b={33:0}, b={33:0}, i=10, size=8] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=10, i=8, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=10, i=8, mask={33:0}] [L26] i++ VAL [b={34:0}, i=9, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=9, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=9, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=140, i=0, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=138, i=1, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=158, i=2, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=143, i=3, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=142, i=4, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=152, i=5, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=148, i=6, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=133, i=7, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=150, i=8, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=162, i=9, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L17] COND TRUE i <= size + 1 VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=130, i=10, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=11, size=9] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=9, b={33:0}, b={33:0}, i=11, size=9] [L20] return i; VAL [\old(size)=9, \result=11, b={33:0}, b={33:0}, i=11, size=9] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=11, i=9, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=11, i=9, mask={33:0}] [L26] i++ VAL [b={34:0}, i=10, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=10, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=10, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=140, i=0, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=138, i=1, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=158, i=2, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=143, i=3, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=142, i=4, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=152, i=5, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=148, i=6, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=133, i=7, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=150, i=8, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=162, i=9, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=130, i=10, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L17] COND TRUE i <= size + 1 VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=145, i=11, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=12, size=10] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=10, b={33:0}, b={33:0}, i=12, size=10] [L20] return i; VAL [\old(size)=10, \result=12, b={33:0}, b={33:0}, i=12, size=10] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=12, i=10, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=12, i=10, mask={33:0}] [L26] i++ VAL [b={34:0}, i=11, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=11, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=11, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=140, i=0, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=138, i=1, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=158, i=2, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=143, i=3, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=142, i=4, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=152, i=5, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=148, i=6, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=133, i=7, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=150, i=8, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=162, i=9, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=130, i=10, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=145, i=11, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L17] COND TRUE i <= size + 1 VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=159, i=12, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=13, size=11] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=11, b={33:0}, b={33:0}, i=13, size=11] [L20] return i; VAL [\old(size)=11, \result=13, b={33:0}, b={33:0}, i=13, size=11] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=13, i=11, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=13, i=11, mask={33:0}] [L26] i++ VAL [b={34:0}, i=12, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=12, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=12, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=140, i=0, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=138, i=1, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=158, i=2, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=143, i=3, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=142, i=4, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=152, i=5, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=148, i=6, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=133, i=7, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=150, i=8, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=162, i=9, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=130, i=10, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=145, i=11, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=159, i=12, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L17] COND TRUE i <= size + 1 VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=131, i=13, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=14, size=12] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=12, b={33:0}, b={33:0}, i=14, size=12] [L20] return i; VAL [\old(size)=12, \result=14, b={33:0}, b={33:0}, i=14, size=12] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=14, i=12, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=14, i=12, mask={33:0}] [L26] i++ VAL [b={34:0}, i=13, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=13, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=13, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=140, i=0, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=138, i=1, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=158, i=2, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=143, i=3, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=142, i=4, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=152, i=5, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=148, i=6, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=133, i=7, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=150, i=8, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=162, i=9, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=130, i=10, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=145, i=11, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=159, i=12, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=131, i=13, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L17] COND TRUE i <= size + 1 VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=147, i=14, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=15, size=13] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=13, b={33:0}, b={33:0}, i=15, size=13] [L20] return i; VAL [\old(size)=13, \result=15, b={33:0}, b={33:0}, i=15, size=13] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=15, i=13, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=15, i=13, mask={33:0}] [L26] i++ VAL [b={34:0}, i=14, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=14, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=14, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=140, i=0, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=138, i=1, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=158, i=2, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=143, i=3, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=142, i=4, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=152, i=5, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=148, i=6, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=133, i=7, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=150, i=8, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=162, i=9, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=130, i=10, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=145, i=11, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=159, i=12, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=131, i=13, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=147, i=14, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L17] COND TRUE i <= size + 1 VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=144, i=15, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=16, size=14] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=14, b={33:0}, b={33:0}, i=16, size=14] [L20] return i; VAL [\old(size)=14, \result=16, b={33:0}, b={33:0}, i=16, size=14] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=16, i=14, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=16, i=14, mask={33:0}] [L26] i++ VAL [b={34:0}, i=15, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=15, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=15, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=140, i=0, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=138, i=1, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=158, i=2, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=143, i=3, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=142, i=4, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=152, i=5, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=148, i=6, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=133, i=7, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=150, i=8, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=162, i=9, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=130, i=10, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=145, i=11, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=159, i=12, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=131, i=13, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=147, i=14, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=144, i=15, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L17] COND TRUE i <= size + 1 VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=134, i=16, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=17, size=15] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=15, b={33:0}, b={33:0}, i=17, size=15] [L20] return i; VAL [\old(size)=15, \result=17, b={33:0}, b={33:0}, i=17, size=15] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=17, i=15, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=17, i=15, mask={33:0}] [L26] i++ VAL [b={34:0}, i=16, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=16, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=16, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=140, i=0, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=138, i=1, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=158, i=2, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=143, i=3, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=142, i=4, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=152, i=5, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=148, i=6, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=133, i=7, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=150, i=8, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=162, i=9, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=130, i=10, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=145, i=11, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=159, i=12, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=131, i=13, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=147, i=14, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=144, i=15, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=134, i=16, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L17] COND TRUE i <= size + 1 VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=139, i=17, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=18, size=16] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=16, b={33:0}, b={33:0}, i=18, size=16] [L20] return i; VAL [\old(size)=16, \result=18, b={33:0}, b={33:0}, i=18, size=16] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=18, i=16, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=18, i=16, mask={33:0}] [L26] i++ VAL [b={34:0}, i=17, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=17, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=17, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=140, i=0, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=138, i=1, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=158, i=2, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=143, i=3, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=142, i=4, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=152, i=5, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=148, i=6, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=133, i=7, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=150, i=8, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=162, i=9, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=130, i=10, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=145, i=11, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=159, i=12, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=131, i=13, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=147, i=14, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=144, i=15, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=134, i=16, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=139, i=17, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L17] COND TRUE i <= size + 1 VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=151, i=18, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=19, size=17] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=17, b={33:0}, b={33:0}, i=19, size=17] [L20] return i; VAL [\old(size)=17, \result=19, b={33:0}, b={33:0}, i=19, size=17] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=19, i=17, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=19, i=17, mask={33:0}] [L26] i++ VAL [b={34:0}, i=18, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=18, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=18, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=140, i=0, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=138, i=1, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=158, i=2, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=143, i=3, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=142, i=4, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=152, i=5, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=148, i=6, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=133, i=7, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=150, i=8, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=162, i=9, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=130, i=10, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=145, i=11, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=159, i=12, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=131, i=13, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=147, i=14, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=144, i=15, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=134, i=16, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=139, i=17, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=151, i=18, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L17] COND TRUE i <= size + 1 VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=129, i=19, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=20, size=18] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=18, b={33:0}, b={33:0}, i=20, size=18] [L20] return i; VAL [\old(size)=18, \result=20, b={33:0}, b={33:0}, i=20, size=18] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=20, i=18, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=20, i=18, mask={33:0}] [L26] i++ VAL [b={34:0}, i=19, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=19, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=19, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=140, i=0, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=138, i=1, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=158, i=2, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=143, i=3, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=142, i=4, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=152, i=5, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=148, i=6, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=133, i=7, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=150, i=8, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=162, i=9, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=130, i=10, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=145, i=11, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=159, i=12, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=131, i=13, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=147, i=14, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=144, i=15, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=134, i=16, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=139, i=17, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=151, i=18, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=129, i=19, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L17] COND TRUE i <= size + 1 VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=156, i=20, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=21, size=19] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=19, b={33:0}, b={33:0}, i=21, size=19] [L20] return i; VAL [\old(size)=19, \result=21, b={33:0}, b={33:0}, i=21, size=19] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=21, i=19, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=21, i=19, mask={33:0}] [L26] i++ VAL [b={34:0}, i=20, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=20, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=20, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=140, i=0, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=138, i=1, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=158, i=2, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=143, i=3, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=142, i=4, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=152, i=5, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=148, i=6, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=133, i=7, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=150, i=8, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=162, i=9, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=130, i=10, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=145, i=11, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=159, i=12, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=131, i=13, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=147, i=14, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=144, i=15, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=134, i=16, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=139, i=17, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=151, i=18, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=129, i=19, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=156, i=20, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L17] COND TRUE i <= size + 1 VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=153, i=21, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=22, size=20] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=20, b={33:0}, b={33:0}, i=22, size=20] [L20] return i; VAL [\old(size)=20, \result=22, b={33:0}, b={33:0}, i=22, size=20] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=22, i=20, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=22, i=20, mask={33:0}] [L26] i++ VAL [b={34:0}, i=21, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=21, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=21, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=140, i=0, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=138, i=1, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=158, i=2, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=143, i=3, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=142, i=4, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=152, i=5, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=148, i=6, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=133, i=7, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=150, i=8, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=162, i=9, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=130, i=10, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=145, i=11, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=159, i=12, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=131, i=13, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=147, i=14, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=144, i=15, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=134, i=16, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=139, i=17, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=151, i=18, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=129, i=19, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=156, i=20, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=153, i=21, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L17] COND TRUE i <= size + 1 VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=154, i=22, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=23, size=21] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=21, b={33:0}, b={33:0}, i=23, size=21] [L20] return i; VAL [\old(size)=21, \result=23, b={33:0}, b={33:0}, i=23, size=21] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=23, i=21, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=23, i=21, mask={33:0}] [L26] i++ VAL [b={34:0}, i=22, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=22, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=22, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=140, i=0, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=138, i=1, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=158, i=2, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=143, i=3, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=142, i=4, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=152, i=5, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=148, i=6, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=133, i=7, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=150, i=8, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=162, i=9, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=130, i=10, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=145, i=11, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=159, i=12, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=131, i=13, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=147, i=14, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=144, i=15, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=134, i=16, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=139, i=17, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=151, i=18, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=129, i=19, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=156, i=20, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=153, i=21, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=154, i=22, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L17] COND TRUE i <= size + 1 VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=149, i=23, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=24, size=22] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=22, b={33:0}, b={33:0}, i=24, size=22] [L20] return i; VAL [\old(size)=22, \result=24, b={33:0}, b={33:0}, i=24, size=22] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=24, i=22, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=24, i=22, mask={33:0}] [L26] i++ VAL [b={34:0}, i=23, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=23, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=23, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=140, i=0, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=138, i=1, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=158, i=2, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=143, i=3, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=142, i=4, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=152, i=5, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=148, i=6, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=133, i=7, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=150, i=8, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=162, i=9, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=130, i=10, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=145, i=11, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=159, i=12, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=131, i=13, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=147, i=14, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=144, i=15, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=134, i=16, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=139, i=17, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=151, i=18, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=129, i=19, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=156, i=20, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=153, i=21, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=154, i=22, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=149, i=23, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L17] COND TRUE i <= size + 1 VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=146, i=24, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=25, size=23] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=23, b={33:0}, b={33:0}, i=25, size=23] [L20] return i; VAL [\old(size)=23, \result=25, b={33:0}, b={33:0}, i=25, size=23] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=25, i=23, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=25, i=23, mask={33:0}] [L26] i++ VAL [b={34:0}, i=24, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=24, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=24, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=140, i=0, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=138, i=1, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=158, i=2, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=143, i=3, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=142, i=4, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=152, i=5, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=148, i=6, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=133, i=7, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=150, i=8, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=162, i=9, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=130, i=10, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=145, i=11, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=159, i=12, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=131, i=13, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=147, i=14, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=144, i=15, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=134, i=16, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=139, i=17, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=151, i=18, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=129, i=19, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=156, i=20, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=153, i=21, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=154, i=22, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=149, i=23, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=146, i=24, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L17] COND TRUE i <= size + 1 VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=157, i=25, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=26, size=24] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=24, b={33:0}, b={33:0}, i=26, size=24] [L20] return i; VAL [\old(size)=24, \result=26, b={33:0}, b={33:0}, i=26, size=24] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=26, i=24, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=26, i=24, mask={33:0}] [L26] i++ VAL [b={34:0}, i=25, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=25, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=25, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=140, i=0, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=138, i=1, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=158, i=2, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=143, i=3, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=142, i=4, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=152, i=5, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=148, i=6, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=133, i=7, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=150, i=8, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=162, i=9, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=130, i=10, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=145, i=11, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=159, i=12, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=131, i=13, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=147, i=14, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=144, i=15, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=134, i=16, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=139, i=17, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=151, i=18, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=129, i=19, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=156, i=20, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=153, i=21, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=154, i=22, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=149, i=23, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=146, i=24, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=157, i=25, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L17] COND TRUE i <= size + 1 VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=132, i=26, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=27, size=25] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=25, b={33:0}, b={33:0}, i=27, size=25] [L20] return i; VAL [\old(size)=25, \result=27, b={33:0}, b={33:0}, i=27, size=25] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=27, i=25, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=27, i=25, mask={33:0}] [L26] i++ VAL [b={34:0}, i=26, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=26, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=26, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=140, i=0, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=138, i=1, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=158, i=2, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=143, i=3, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=142, i=4, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=152, i=5, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=148, i=6, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=133, i=7, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=150, i=8, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=162, i=9, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=130, i=10, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=145, i=11, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=159, i=12, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=131, i=13, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=147, i=14, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=144, i=15, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=134, i=16, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=139, i=17, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=151, i=18, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=129, i=19, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=156, i=20, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=153, i=21, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=154, i=22, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=149, i=23, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=146, i=24, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=157, i=25, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=132, i=26, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L17] COND TRUE i <= size + 1 VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=155, i=27, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=28, size=26] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=26, b={33:0}, b={33:0}, i=28, size=26] [L20] return i; VAL [\old(size)=26, \result=28, b={33:0}, b={33:0}, i=28, size=26] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=28, i=26, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=28, i=26, mask={33:0}] [L26] i++ VAL [b={34:0}, i=27, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=27, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=27, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=140, i=0, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=138, i=1, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=158, i=2, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=143, i=3, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=142, i=4, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=152, i=5, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=148, i=6, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=133, i=7, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=150, i=8, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=162, i=9, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=130, i=10, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=145, i=11, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=159, i=12, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=131, i=13, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=147, i=14, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=144, i=15, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=134, i=16, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=139, i=17, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=151, i=18, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=129, i=19, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=156, i=20, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=153, i=21, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=154, i=22, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=149, i=23, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=146, i=24, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=157, i=25, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=132, i=26, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=155, i=27, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L17] COND TRUE i <= size + 1 VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=136, i=28, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=29, size=27] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=27, b={33:0}, b={33:0}, i=29, size=27] [L20] return i; VAL [\old(size)=27, \result=29, b={33:0}, b={33:0}, i=29, size=27] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=29, i=27, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=29, i=27, mask={33:0}] [L26] i++ VAL [b={34:0}, i=28, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=28, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=28, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=140, i=0, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=138, i=1, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=158, i=2, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=143, i=3, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=142, i=4, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=152, i=5, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=148, i=6, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=133, i=7, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=150, i=8, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=162, i=9, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=130, i=10, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=145, i=11, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=159, i=12, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=131, i=13, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=147, i=14, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=144, i=15, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=134, i=16, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=139, i=17, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=151, i=18, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=129, i=19, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=156, i=20, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=153, i=21, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=154, i=22, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=149, i=23, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=146, i=24, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=157, i=25, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=132, i=26, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=155, i=27, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=136, i=28, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L17] COND TRUE i <= size + 1 VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=161, i=29, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=30, size=28] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=28, b={33:0}, b={33:0}, i=30, size=28] [L20] return i; VAL [\old(size)=28, \result=30, b={33:0}, b={33:0}, i=30, size=28] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=30, i=28, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=30, i=28, mask={33:0}] [L26] i++ VAL [b={34:0}, i=29, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=29, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=29, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=140, i=0, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=138, i=1, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=158, i=2, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=143, i=3, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=142, i=4, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=152, i=5, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=148, i=6, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=133, i=7, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=150, i=8, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=162, i=9, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=130, i=10, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=145, i=11, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=159, i=12, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=131, i=13, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=147, i=14, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=144, i=15, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=134, i=16, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=139, i=17, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=151, i=18, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=129, i=19, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=156, i=20, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=153, i=21, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=154, i=22, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=149, i=23, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=146, i=24, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=157, i=25, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=132, i=26, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=155, i=27, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=136, i=28, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=161, i=29, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L17] COND TRUE i <= size + 1 VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=141, i=30, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=31, size=29] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=29, b={33:0}, b={33:0}, i=31, size=29] [L20] return i; VAL [\old(size)=29, \result=31, b={33:0}, b={33:0}, i=31, size=29] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=31, i=29, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=31, i=29, mask={33:0}] [L26] i++ VAL [b={34:0}, i=30, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=30, mask={33:0}] [L27] CALL, EXPR foo(mask, i) VAL [\old(size)=30, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=140, i=0, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=138, i=1, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=158, i=2, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=143, i=3, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=142, i=4, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=152, i=5, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=148, i=6, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=133, i=7, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=150, i=8, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=162, i=9, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=130, i=10, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=145, i=11, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=159, i=12, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=131, i=13, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=147, i=14, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=144, i=15, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=134, i=16, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=139, i=17, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=151, i=18, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=129, i=19, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=156, i=20, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=153, i=21, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=154, i=22, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=149, i=23, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=146, i=24, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=157, i=25, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=132, i=26, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=155, i=27, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=136, i=28, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=161, i=29, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=141, i=30, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L17] COND TRUE i <= size + 1 VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=135, i=31, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=32, size=30] [L17] COND FALSE !(i <= size + 1) VAL [\old(size)=30, b={33:0}, b={33:0}, i=32, size=30] [L20] return i; VAL [\old(size)=30, \result=32, b={33:0}, b={33:0}, i=32, size=30] [L27] RET, EXPR foo(mask, i) VAL [b={34:0}, foo(mask, i)=32, i=30, mask={33:0}] [L27] b[i] = foo(mask, i) VAL [b={34:0}, foo(mask, i)=32, i=30, mask={33:0}] [L26] i++ VAL [b={34:0}, i=31, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=31, mask={33:0}] [L27] CALL foo(mask, i) VAL [\old(size)=31, b={33:0}] [L15] char a[33]; [L16] int i; [L17] i = 0 VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=140, i=0, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=138, i=1, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=158, i=2, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=143, i=3, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=142, i=4, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=152, i=5, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=148, i=6, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=133, i=7, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=150, i=8, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=162, i=9, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=130, i=10, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=145, i=11, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=159, i=12, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=131, i=13, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=147, i=14, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=144, i=15, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=134, i=16, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=139, i=17, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=151, i=18, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=129, i=19, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=156, i=20, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=153, i=21, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=154, i=22, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=149, i=23, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=146, i=24, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=157, i=25, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=132, i=26, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=155, i=27, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=136, i=28, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=161, i=29, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=141, i=30, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=135, i=31, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L17] COND TRUE i <= size + 1 VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L18] a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L18] b[i] - UnprovableResult [Line: 18]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 658540.00ms, OverallIterations: 63, TraceHistogramMax: 560, EmptinessCheckTime: 868.29ms, AutomataDifference: 128481.78ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 11.67ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40565 SdHoareTripleChecker+Valid, 45495.06ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40463 mSDsluCounter, 4591 SdHoareTripleChecker+Invalid, 37474.27ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15822 IncrementalHoareTripleChecker+Unchecked, 17023 mSDsCounter, 6842 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129641 IncrementalHoareTripleChecker+Invalid, 152305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6842 mSolverCounterUnsat, 653 mSDtfsCounter, 129641 mSolverCounterSat, 381.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115208 GetRequests, 108460 SyntacticMatches, 543 SemanticMatches, 6205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358118 ImplicationChecksByTransitivity, 164392.42ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2748occurred in iteration=62, InterpolantAutomatonStates: 3361, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 714.58ms AutomataMinimizationTime, 62 MinimizatonAttempts, 1432 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3495.29ms SsaConstructionTime, 219590.81ms SatisfiabilityAnalysisTime, 287986.75ms InterpolantComputationTime, 113056 NumberOfCodeBlocks, 103790 NumberOfCodeBlocksAsserted, 723 NumberOfCheckSat, 163769 ConstructedInterpolants, 14064 QuantifiedInterpolants, 402237 SizeOfPredicates, 216 NumberOfNonLiveVariables, 116096 ConjunctsInSsa, 1704 ConjunctsInUnsatCore, 166 InterpolantComputations, 13 PerfectInterpolantSequences, 24721484/25151679 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:52:13,107 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...