java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:10:46,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:10:46,581 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:10:46,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:10:46,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:10:46,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:10:46,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:10:46,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:10:46,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:10:46,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:10:46,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:10:46,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:10:46,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:10:46,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:10:46,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:10:46,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:10:46,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:10:46,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:10:46,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:10:46,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:10:46,611 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:10:46,611 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:10:46,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:10:46,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:10:46,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:10:46,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:10:46,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:10:46,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:10:46,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:10:46,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:10:46,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:10:46,616 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 16:10:46,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:10:46,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:10:46,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:10:46,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:10:46,635 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:10:46,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:10:46,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:10:46,636 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:10:46,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:10:46,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:10:46,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:10:46,636 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:10:46,637 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:10:46,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:10:46,637 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:10:46,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:10:46,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:10:46,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:10:46,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:10:46,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:10:46,638 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:10:46,638 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:10:46,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:10:46,638 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:10:46,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:10:46,674 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:10:46,678 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:10:46,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:10:46,679 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:10:46,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 16:10:46,959 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2db748e36 [2018-04-10 16:10:47,055 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:10:47,055 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:10:47,056 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 16:10:47,056 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:10:47,056 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:10:47,056 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:10:47,056 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo ('foo') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 16:10:47,056 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 16:10:47,057 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:10:47,057 INFO L233 ultiparseSymbolTable]: [2018-04-10 16:10:47,067 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2db748e36 [2018-04-10 16:10:47,070 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:10:47,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:10:47,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:10:47,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:10:47,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:10:47,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0e957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47, skipping insertion in model container [2018-04-10 16:10:47,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,091 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:10:47,101 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:10:47,215 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:10:47,236 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:10:47,241 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 16:10:47,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47 WrapperNode [2018-04-10 16:10:47,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:10:47,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:10:47,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:10:47,249 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:10:47,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... [2018-04-10 16:10:47,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:10:47,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:10:47,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:10:47,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:10:47,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:10:47,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:10:47,321 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:10:47,321 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-10 16:10:47,321 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:10:47,321 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-10 16:10:47,321 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:10:47,321 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:10:47,321 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:10:47,321 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:10:47,321 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:10:47,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:10:47,322 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:10:47,322 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:10:47,518 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:10:47,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:10:47 BoogieIcfgContainer [2018-04-10 16:10:47,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:10:47,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:10:47,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:10:47,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:10:47,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:10:47" (1/3) ... [2018-04-10 16:10:47,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12061817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:10:47, skipping insertion in model container [2018-04-10 16:10:47,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:10:47" (2/3) ... [2018-04-10 16:10:47,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12061817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:10:47, skipping insertion in model container [2018-04-10 16:10:47,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:10:47" (3/3) ... [2018-04-10 16:10:47,524 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 16:10:47,532 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:10:47,537 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 16:10:47,565 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:10:47,566 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:10:47,566 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:10:47,566 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:10:47,566 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:10:47,566 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:10:47,566 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:10:47,566 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:10:47,567 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:10:47,567 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:10:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-10 16:10:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-10 16:10:47,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:47,584 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:47,584 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-04-10 16:10:47,588 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:47,588 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:47,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:47,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:47,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:47,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:10:47,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:10:47,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:10:47,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:10:47,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:10:47,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:10:47,719 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-10 16:10:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:47,782 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-10 16:10:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:10:47,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-10 16:10:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:47,790 INFO L225 Difference]: With dead ends: 63 [2018-04-10 16:10:47,790 INFO L226 Difference]: Without dead ends: 59 [2018-04-10 16:10:47,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:10:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-10 16:10:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-10 16:10:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 16:10:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-10 16:10:47,819 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-10 16:10:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:47,820 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-10 16:10:47,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:10:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-10 16:10:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:10:47,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:47,821 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:47,821 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:47,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-04-10 16:10:47,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:47,821 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:47,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:47,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:47,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:47,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:10:47,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:10:47,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:10:47,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:10:47,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:10:47,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:10:47,872 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-10 16:10:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:47,896 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-10 16:10:47,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:10:47,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-10 16:10:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:47,898 INFO L225 Difference]: With dead ends: 60 [2018-04-10 16:10:47,898 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 16:10:47,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:10:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 16:10:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-10 16:10:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-10 16:10:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-10 16:10:47,902 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-10 16:10:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:47,902 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-10 16:10:47,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:10:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-10 16:10:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:10:47,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:47,903 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:47,903 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-04-10 16:10:47,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:47,903 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:47,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:47,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:47,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:47,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:10:48,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:10:48,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:10:48,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:10:48,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:10:48,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:10:48,017 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-04-10 16:10:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:48,209 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-04-10 16:10:48,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:10:48,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-04-10 16:10:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:48,211 INFO L225 Difference]: With dead ends: 75 [2018-04-10 16:10:48,211 INFO L226 Difference]: Without dead ends: 75 [2018-04-10 16:10:48,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:10:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-10 16:10:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-04-10 16:10:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-10 16:10:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-04-10 16:10:48,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-04-10 16:10:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:48,218 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-04-10 16:10:48,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:10:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-04-10 16:10:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:10:48,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:48,219 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:48,219 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-04-10 16:10:48,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:48,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:48,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:48,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:48,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:10:48,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:10:48,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:10:48,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:10:48,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:10:48,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:10:48,257 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-04-10 16:10:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:48,307 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-04-10 16:10:48,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:10:48,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:10:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:48,309 INFO L225 Difference]: With dead ends: 65 [2018-04-10 16:10:48,309 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 16:10:48,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:10:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 16:10:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-10 16:10:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 16:10:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-04-10 16:10:48,313 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-04-10 16:10:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:48,313 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-04-10 16:10:48,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:10:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-04-10 16:10:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:10:48,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:48,314 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:48,314 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-04-10 16:10:48,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:48,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:48,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:48,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:48,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:10:48,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:48,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:48,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:48,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:10:48,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:48,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-04-10 16:10:48,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:10:48,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:10:48,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:10:48,439 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-04-10 16:10:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:48,568 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-04-10 16:10:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:10:48,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-10 16:10:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:48,570 INFO L225 Difference]: With dead ends: 105 [2018-04-10 16:10:48,570 INFO L226 Difference]: Without dead ends: 105 [2018-04-10 16:10:48,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:10:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-10 16:10:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-04-10 16:10:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-10 16:10:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-04-10 16:10:48,574 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2018-04-10 16:10:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:48,575 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-04-10 16:10:48,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:10:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-04-10 16:10:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:10:48,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:48,583 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:48,583 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-04-10 16:10:48,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:48,584 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:48,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:48,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:48,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:10:48,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:10:48,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:10:48,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:10:48,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:10:48,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:10:48,625 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-04-10 16:10:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:48,650 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-10 16:10:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:10:48,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 16:10:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:48,652 INFO L225 Difference]: With dead ends: 85 [2018-04-10 16:10:48,652 INFO L226 Difference]: Without dead ends: 85 [2018-04-10 16:10:48,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:10:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-10 16:10:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-04-10 16:10:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-10 16:10:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-04-10 16:10:48,658 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 29 [2018-04-10 16:10:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:48,658 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-04-10 16:10:48,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:10:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-04-10 16:10:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:10:48,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:48,659 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:48,660 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-04-10 16:10:48,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:48,660 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:48,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:48,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:48,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:10:48,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:48,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:48,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:10:48,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:48,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-10 16:10:48,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:10:48,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:10:48,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:10:48,729 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 5 states. [2018-04-10 16:10:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:48,760 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-04-10 16:10:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:10:48,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-10 16:10:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:48,761 INFO L225 Difference]: With dead ends: 99 [2018-04-10 16:10:48,762 INFO L226 Difference]: Without dead ends: 99 [2018-04-10 16:10:48,762 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:10:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-10 16:10:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2018-04-10 16:10:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-10 16:10:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-04-10 16:10:48,766 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 37 [2018-04-10 16:10:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:48,767 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-04-10 16:10:48,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:10:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-04-10 16:10:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:10:48,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:48,768 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1] [2018-04-10 16:10:48,768 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-04-10 16:10:48,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:48,768 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:48,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:48,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:48,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 16:10:48,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:48,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:48,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:10:48,856 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 16:10:48,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:48,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:48,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:10:48,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:10:48,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:10:48,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:10:48,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:10:48,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:10:48,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:10:48,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:10:48,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:10:48,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:10:48,943 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-04-10 16:10:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-04-10 16:10:48,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:10:48,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-04-10 16:10:48,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:10:48,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:10:48,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-04-10 16:10:48,951 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 10 states. [2018-04-10 16:10:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:49,157 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-04-10 16:10:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:10:49,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-04-10 16:10:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:49,157 INFO L225 Difference]: With dead ends: 105 [2018-04-10 16:10:49,158 INFO L226 Difference]: Without dead ends: 77 [2018-04-10 16:10:49,158 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=206, Unknown=1, NotChecked=30, Total=306 [2018-04-10 16:10:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-10 16:10:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-04-10 16:10:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-10 16:10:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-04-10 16:10:49,160 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-04-10 16:10:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:49,161 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-04-10 16:10:49,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:10:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-04-10 16:10:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 16:10:49,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:49,161 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:49,162 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:49,162 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-04-10 16:10:49,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:49,162 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:49,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:49,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:49,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:49,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-04-10 16:10:49,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:49,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:49,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:49,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 16:10:49,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:49,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-04-10 16:10:49,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:10:49,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:10:49,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:10:49,428 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 16 states. [2018-04-10 16:10:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:49,760 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-04-10 16:10:49,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:10:49,761 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-04-10 16:10:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:49,762 INFO L225 Difference]: With dead ends: 133 [2018-04-10 16:10:49,762 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 16:10:49,762 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-04-10 16:10:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 16:10:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2018-04-10 16:10:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-10 16:10:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-04-10 16:10:49,766 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 59 [2018-04-10 16:10:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:49,766 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-04-10 16:10:49,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:10:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-04-10 16:10:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 16:10:49,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:49,768 INFO L355 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:49,768 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash -480231808, now seen corresponding path program 2 times [2018-04-10 16:10:49,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:49,768 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:49,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:49,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:49,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:49,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-04-10 16:10:49,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:10:49,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:10:49,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:10:49,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:10:49,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:10:49,843 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 7 states. [2018-04-10 16:10:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:49,896 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-04-10 16:10:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:10:49,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-04-10 16:10:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:49,897 INFO L225 Difference]: With dead ends: 111 [2018-04-10 16:10:49,897 INFO L226 Difference]: Without dead ends: 105 [2018-04-10 16:10:49,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:10:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-10 16:10:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-10 16:10:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-10 16:10:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-04-10 16:10:49,901 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 77 [2018-04-10 16:10:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:49,901 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-04-10 16:10:49,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:10:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-04-10 16:10:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-10 16:10:49,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:49,903 INFO L355 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:49,903 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash 49530632, now seen corresponding path program 3 times [2018-04-10 16:10:49,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:49,903 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:49,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:49,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:49,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:49,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-04-10 16:10:49,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:49,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:49,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:10:49,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 16:10:49,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:49,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 143 proven. 38 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 16:10:50,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:50,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 16 [2018-04-10 16:10:50,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:10:50,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:10:50,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:10:50,100 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 16 states. [2018-04-10 16:10:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:50,256 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-04-10 16:10:50,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:10:50,256 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 83 [2018-04-10 16:10:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:50,257 INFO L225 Difference]: With dead ends: 105 [2018-04-10 16:10:50,257 INFO L226 Difference]: Without dead ends: 99 [2018-04-10 16:10:50,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:10:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-10 16:10:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-10 16:10:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-10 16:10:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-04-10 16:10:50,261 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 83 [2018-04-10 16:10:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:50,262 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-04-10 16:10:50,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:10:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-04-10 16:10:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-10 16:10:50,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:50,263 INFO L355 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:50,263 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1376831888, now seen corresponding path program 4 times [2018-04-10 16:10:50,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:50,264 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:50,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:50,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:50,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:50,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 185 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-04-10 16:10:50,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:50,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:50,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:10:50,357 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:10:50,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:50,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 186 proven. 14 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-04-10 16:10:50,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:50,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-04-10 16:10:50,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:10:50,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:10:50,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:10:50,482 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 17 states. [2018-04-10 16:10:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:50,762 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2018-04-10 16:10:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:10:50,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2018-04-10 16:10:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:50,763 INFO L225 Difference]: With dead ends: 149 [2018-04-10 16:10:50,763 INFO L226 Difference]: Without dead ends: 140 [2018-04-10 16:10:50,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:10:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-10 16:10:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2018-04-10 16:10:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-10 16:10:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2018-04-10 16:10:50,768 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 89 [2018-04-10 16:10:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:50,768 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2018-04-10 16:10:50,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:10:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2018-04-10 16:10:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-04-10 16:10:50,770 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:50,770 INFO L355 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:50,770 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2114920591, now seen corresponding path program 5 times [2018-04-10 16:10:50,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:50,771 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:50,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:50,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:50,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:50,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 257 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-04-10 16:10:51,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:51,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:51,030 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:10:51,062 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-10 16:10:51,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:51,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 409 proven. 24 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-04-10 16:10:51,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:51,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-04-10 16:10:51,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:10:51,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:10:51,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:10:51,169 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 18 states. [2018-04-10 16:10:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:51,457 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-04-10 16:10:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:10:51,457 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-04-10 16:10:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:51,458 INFO L225 Difference]: With dead ends: 152 [2018-04-10 16:10:51,458 INFO L226 Difference]: Without dead ends: 146 [2018-04-10 16:10:51,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:10:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-10 16:10:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2018-04-10 16:10:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-10 16:10:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-04-10 16:10:51,462 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 125 [2018-04-10 16:10:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:51,462 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-04-10 16:10:51,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:10:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-04-10 16:10:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 16:10:51,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:51,464 INFO L355 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:51,464 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash -936202175, now seen corresponding path program 6 times [2018-04-10 16:10:51,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:51,464 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:51,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:51,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:51,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:51,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 345 proven. 80 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-04-10 16:10:51,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:51,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:51,724 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:10:51,756 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-10 16:10:51,756 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:51,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 388 proven. 229 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-04-10 16:10:51,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:51,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 26 [2018-04-10 16:10:51,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:10:51,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:10:51,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:10:51,991 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 26 states. [2018-04-10 16:10:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:52,643 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2018-04-10 16:10:52,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:10:52,643 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 137 [2018-04-10 16:10:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:52,644 INFO L225 Difference]: With dead ends: 202 [2018-04-10 16:10:52,644 INFO L226 Difference]: Without dead ends: 202 [2018-04-10 16:10:52,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 16:10:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-10 16:10:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2018-04-10 16:10:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-10 16:10:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2018-04-10 16:10:52,648 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 137 [2018-04-10 16:10:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:52,648 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2018-04-10 16:10:52,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:10:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2018-04-10 16:10:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-10 16:10:52,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:52,650 INFO L355 BasicCegarLoop]: trace histogram [24, 20, 20, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:52,650 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1943695766, now seen corresponding path program 7 times [2018-04-10 16:10:52,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:52,650 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:52,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:52,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:52,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:52,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 905 proven. 44 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-04-10 16:10:52,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:52,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:52,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:52,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 694 proven. 52 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-04-10 16:10:52,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:52,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-04-10 16:10:52,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:10:52,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:10:52,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:10:52,988 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 25 states. [2018-04-10 16:10:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:53,439 INFO L93 Difference]: Finished difference Result 251 states and 254 transitions. [2018-04-10 16:10:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:10:53,439 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2018-04-10 16:10:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:53,440 INFO L225 Difference]: With dead ends: 251 [2018-04-10 16:10:53,440 INFO L226 Difference]: Without dead ends: 242 [2018-04-10 16:10:53,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=1541, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 16:10:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-10 16:10:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 237. [2018-04-10 16:10:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-10 16:10:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2018-04-10 16:10:53,444 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 179 [2018-04-10 16:10:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:53,444 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 240 transitions. [2018-04-10 16:10:53,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:10:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 240 transitions. [2018-04-10 16:10:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-10 16:10:53,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:53,445 INFO L355 BasicCegarLoop]: trace histogram [31, 26, 26, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:53,445 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash -431804325, now seen corresponding path program 8 times [2018-04-10 16:10:53,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:53,445 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:53,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:10:53,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:53,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 1423 proven. 70 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-04-10 16:10:53,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:53,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:53,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:10:53,660 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:10:53,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:53,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:53,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:10:53,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:10:53,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:10:53,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:10:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 835 proven. 92 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-04-10 16:10:54,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:54,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-04-10 16:10:54,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:10:54,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:10:54,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:10:54,059 INFO L87 Difference]: Start difference. First operand 237 states and 240 transitions. Second operand 26 states. [2018-04-10 16:10:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:54,880 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-04-10 16:10:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 16:10:54,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 227 [2018-04-10 16:10:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:54,882 INFO L225 Difference]: With dead ends: 302 [2018-04-10 16:10:54,882 INFO L226 Difference]: Without dead ends: 293 [2018-04-10 16:10:54,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 214 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=892, Invalid=3938, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 16:10:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-10 16:10:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 285. [2018-04-10 16:10:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-10 16:10:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 287 transitions. [2018-04-10 16:10:54,888 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 287 transitions. Word has length 227 [2018-04-10 16:10:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:54,888 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 287 transitions. [2018-04-10 16:10:54,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:10:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 287 transitions. [2018-04-10 16:10:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-04-10 16:10:54,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:54,890 INFO L355 BasicCegarLoop]: trace histogram [39, 33, 33, 32, 32, 32, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:54,890 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1397576748, now seen corresponding path program 9 times [2018-04-10 16:10:54,890 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:54,890 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:54,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:54,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:54,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:54,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2089 proven. 102 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2018-04-10 16:10:55,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:55,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:55,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:10:55,250 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-10 16:10:55,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:55,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:55,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:10:55,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:10:55,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:10:55,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:10:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 1130 proven. 114 refuted. 0 times theorem prover too weak. 2466 trivial. 0 not checked. [2018-04-10 16:10:55,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:55,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2018-04-10 16:10:55,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:10:55,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:10:55,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:10:55,684 INFO L87 Difference]: Start difference. First operand 285 states and 287 transitions. Second operand 27 states. [2018-04-10 16:10:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:56,216 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2018-04-10 16:10:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:10:56,216 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 281 [2018-04-10 16:10:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:56,217 INFO L225 Difference]: With dead ends: 309 [2018-04-10 16:10:56,217 INFO L226 Difference]: Without dead ends: 303 [2018-04-10 16:10:56,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 266 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1604, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 16:10:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-10 16:10:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2018-04-10 16:10:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 16:10:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 299 transitions. [2018-04-10 16:10:56,221 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 299 transitions. Word has length 281 [2018-04-10 16:10:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:56,222 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 299 transitions. [2018-04-10 16:10:56,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:10:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 299 transitions. [2018-04-10 16:10:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-04-10 16:10:56,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:56,223 INFO L355 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:56,223 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 10 times [2018-04-10 16:10:56,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:56,223 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:56,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:56,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:56,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:56,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-04-10 16:10:56,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:56,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:56,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:10:56,733 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:10:56,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:56,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:56,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:10:56,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:10:56,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:10:56,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:10:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-04-10 16:10:57,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:57,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2018-04-10 16:10:57,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:10:57,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:10:57,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:10:57,141 INFO L87 Difference]: Start difference. First operand 297 states and 299 transitions. Second operand 25 states. [2018-04-10 16:10:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:57,345 INFO L93 Difference]: Finished difference Result 321 states and 325 transitions. [2018-04-10 16:10:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:10:57,346 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 293 [2018-04-10 16:10:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:57,347 INFO L225 Difference]: With dead ends: 321 [2018-04-10 16:10:57,347 INFO L226 Difference]: Without dead ends: 321 [2018-04-10 16:10:57,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 270 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=757, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 16:10:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-10 16:10:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 303. [2018-04-10 16:10:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-10 16:10:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 306 transitions. [2018-04-10 16:10:57,352 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 306 transitions. Word has length 293 [2018-04-10 16:10:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:57,352 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 306 transitions. [2018-04-10 16:10:57,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:10:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 306 transitions. [2018-04-10 16:10:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-04-10 16:10:57,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:57,353 INFO L355 BasicCegarLoop]: trace histogram [42, 36, 36, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:57,353 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 11 times [2018-04-10 16:10:57,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:57,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:57,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:57,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:57,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:57,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1695 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-10 16:10:57,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:57,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:57,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:10:57,812 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-04-10 16:10:57,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:57,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1651 proven. 736 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2018-04-10 16:10:58,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:58,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 34 [2018-04-10 16:10:58,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 16:10:58,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 16:10:58,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 16:10:58,139 INFO L87 Difference]: Start difference. First operand 303 states and 306 transitions. Second operand 34 states. [2018-04-10 16:10:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:10:58,539 INFO L93 Difference]: Finished difference Result 377 states and 381 transitions. [2018-04-10 16:10:58,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 16:10:58,540 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 299 [2018-04-10 16:10:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:10:58,542 INFO L225 Difference]: With dead ends: 377 [2018-04-10 16:10:58,542 INFO L226 Difference]: Without dead ends: 377 [2018-04-10 16:10:58,543 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=558, Invalid=2094, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 16:10:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-10 16:10:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 369. [2018-04-10 16:10:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-04-10 16:10:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 373 transitions. [2018-04-10 16:10:58,549 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 373 transitions. Word has length 299 [2018-04-10 16:10:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:10:58,549 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 373 transitions. [2018-04-10 16:10:58,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 16:10:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 373 transitions. [2018-04-10 16:10:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-04-10 16:10:58,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:10:58,551 INFO L355 BasicCegarLoop]: trace histogram [50, 43, 43, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:10:58,551 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:10:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1483763557, now seen corresponding path program 12 times [2018-04-10 16:10:58,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:10:58,552 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:10:58,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:58,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:10:58,553 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:10:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:10:58,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:10:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6223 backedges. 3357 proven. 140 refuted. 0 times theorem prover too weak. 2726 trivial. 0 not checked. [2018-04-10 16:10:58,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:10:58,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:10:58,948 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:10:58,987 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-10 16:10:58,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:10:58,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:10:59,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:10:59,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:10:59,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:10:59,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:10:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6223 backedges. 1901 proven. 170 refuted. 0 times theorem prover too weak. 4152 trivial. 0 not checked. [2018-04-10 16:10:59,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:10:59,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-04-10 16:10:59,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 16:10:59,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 16:10:59,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:10:59,677 INFO L87 Difference]: Start difference. First operand 369 states and 373 transitions. Second operand 32 states. [2018-04-10 16:11:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:00,854 INFO L93 Difference]: Finished difference Result 446 states and 449 transitions. [2018-04-10 16:11:00,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 16:11:00,854 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 353 [2018-04-10 16:11:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:00,856 INFO L225 Difference]: With dead ends: 446 [2018-04-10 16:11:00,856 INFO L226 Difference]: Without dead ends: 437 [2018-04-10 16:11:00,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 336 SyntacticMatches, 13 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1497, Invalid=6875, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 16:11:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-10 16:11:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 429. [2018-04-10 16:11:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-04-10 16:11:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 432 transitions. [2018-04-10 16:11:00,865 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 432 transitions. Word has length 353 [2018-04-10 16:11:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:00,865 INFO L459 AbstractCegarLoop]: Abstraction has 429 states and 432 transitions. [2018-04-10 16:11:00,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 16:11:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 432 transitions. [2018-04-10 16:11:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-04-10 16:11:00,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:00,868 INFO L355 BasicCegarLoop]: trace histogram [60, 52, 52, 51, 51, 51, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:00,868 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:00,868 INFO L82 PathProgramCache]: Analyzing trace with hash -983766034, now seen corresponding path program 13 times [2018-04-10 16:11:00,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:00,868 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:00,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:00,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:00,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:00,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9062 backedges. 4485 proven. 184 refuted. 0 times theorem prover too weak. 4393 trivial. 0 not checked. [2018-04-10 16:11:01,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:01,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:01,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:01,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9062 backedges. 4485 proven. 184 refuted. 0 times theorem prover too weak. 4393 trivial. 0 not checked. [2018-04-10 16:11:01,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:01,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-04-10 16:11:01,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 16:11:01,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 16:11:01,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:11:01,857 INFO L87 Difference]: Start difference. First operand 429 states and 432 transitions. Second operand 29 states. [2018-04-10 16:11:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:02,242 INFO L93 Difference]: Finished difference Result 457 states and 460 transitions. [2018-04-10 16:11:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:11:02,242 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 419 [2018-04-10 16:11:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:02,244 INFO L225 Difference]: With dead ends: 457 [2018-04-10 16:11:02,244 INFO L226 Difference]: Without dead ends: 451 [2018-04-10 16:11:02,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 16:11:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-10 16:11:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 439. [2018-04-10 16:11:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-04-10 16:11:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 442 transitions. [2018-04-10 16:11:02,249 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 442 transitions. Word has length 419 [2018-04-10 16:11:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:02,249 INFO L459 AbstractCegarLoop]: Abstraction has 439 states and 442 transitions. [2018-04-10 16:11:02,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 16:11:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 442 transitions. [2018-04-10 16:11:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-04-10 16:11:02,251 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:02,251 INFO L355 BasicCegarLoop]: trace histogram [61, 53, 53, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:02,251 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1494870518, now seen corresponding path program 14 times [2018-04-10 16:11:02,251 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:02,251 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:02,252 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:02,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:02,252 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:02,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2440 proven. 200 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-04-10 16:11:02,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:02,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:02,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:02,837 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:02,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:02,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:02,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:11:02,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:02,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:11:02,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:11:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2440 proven. 216 refuted. 0 times theorem prover too weak. 6732 trivial. 0 not checked. [2018-04-10 16:11:03,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:03,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-04-10 16:11:03,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:11:03,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:11:03,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:11:03,442 INFO L87 Difference]: Start difference. First operand 439 states and 442 transitions. Second operand 28 states. [2018-04-10 16:11:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:03,991 INFO L93 Difference]: Finished difference Result 543 states and 550 transitions. [2018-04-10 16:11:03,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 16:11:03,991 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 425 [2018-04-10 16:11:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:03,993 INFO L225 Difference]: With dead ends: 543 [2018-04-10 16:11:03,993 INFO L226 Difference]: Without dead ends: 543 [2018-04-10 16:11:03,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 395 SyntacticMatches, 17 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=620, Invalid=1930, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 16:11:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-04-10 16:11:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 513. [2018-04-10 16:11:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-10 16:11:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 518 transitions. [2018-04-10 16:11:04,000 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 518 transitions. Word has length 425 [2018-04-10 16:11:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:04,001 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 518 transitions. [2018-04-10 16:11:04,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:11:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 518 transitions. [2018-04-10 16:11:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-04-10 16:11:04,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:04,004 INFO L355 BasicCegarLoop]: trace histogram [73, 64, 64, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:04,004 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 15 times [2018-04-10 16:11:04,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:04,005 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:04,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:04,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:04,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:04,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 3599 proven. 310 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-04-10 16:11:04,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:04,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:04,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:04,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-04-10 16:11:04,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:04,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 6029 proven. 814 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-04-10 16:11:05,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:05,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 42 [2018-04-10 16:11:05,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 16:11:05,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 16:11:05,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:11:05,341 INFO L87 Difference]: Start difference. First operand 513 states and 518 transitions. Second operand 42 states. [2018-04-10 16:11:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:06,609 INFO L93 Difference]: Finished difference Result 713 states and 723 transitions. [2018-04-10 16:11:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 16:11:06,610 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 503 [2018-04-10 16:11:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:06,612 INFO L225 Difference]: With dead ends: 713 [2018-04-10 16:11:06,612 INFO L226 Difference]: Without dead ends: 713 [2018-04-10 16:11:06,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1186, Invalid=5134, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 16:11:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-04-10 16:11:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 615. [2018-04-10 16:11:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-04-10 16:11:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 623 transitions. [2018-04-10 16:11:06,623 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 623 transitions. Word has length 503 [2018-04-10 16:11:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:06,623 INFO L459 AbstractCegarLoop]: Abstraction has 615 states and 623 transitions. [2018-04-10 16:11:06,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 16:11:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 623 transitions. [2018-04-10 16:11:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-04-10 16:11:06,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:06,627 INFO L355 BasicCegarLoop]: trace histogram [75, 66, 66, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:06,627 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 874224735, now seen corresponding path program 16 times [2018-04-10 16:11:06,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:06,627 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:06,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:06,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:06,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:06,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4005 proven. 374 refuted. 0 times theorem prover too weak. 10026 trivial. 0 not checked. [2018-04-10 16:11:07,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:07,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:07,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:07,467 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:07,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:07,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 5956 proven. 1459 refuted. 0 times theorem prover too weak. 6990 trivial. 0 not checked. [2018-04-10 16:11:08,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:08,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29] total 44 [2018-04-10 16:11:08,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 16:11:08,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 16:11:08,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1624, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:11:08,165 INFO L87 Difference]: Start difference. First operand 615 states and 623 transitions. Second operand 44 states. [2018-04-10 16:11:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:09,603 INFO L93 Difference]: Finished difference Result 727 states and 738 transitions. [2018-04-10 16:11:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 16:11:09,604 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 515 [2018-04-10 16:11:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:09,605 INFO L225 Difference]: With dead ends: 727 [2018-04-10 16:11:09,606 INFO L226 Difference]: Without dead ends: 727 [2018-04-10 16:11:09,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 488 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1342, Invalid=5968, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 16:11:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-04-10 16:11:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 552. [2018-04-10 16:11:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-04-10 16:11:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 560 transitions. [2018-04-10 16:11:09,612 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 560 transitions. Word has length 515 [2018-04-10 16:11:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:09,613 INFO L459 AbstractCegarLoop]: Abstraction has 552 states and 560 transitions. [2018-04-10 16:11:09,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 16:11:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 560 transitions. [2018-04-10 16:11:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-04-10 16:11:09,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:09,615 INFO L355 BasicCegarLoop]: trace histogram [77, 68, 68, 67, 67, 67, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:09,615 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -637722385, now seen corresponding path program 17 times [2018-04-10 16:11:09,615 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:09,615 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:09,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:09,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:09,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:09,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 4423 proven. 276 refuted. 0 times theorem prover too weak. 10536 trivial. 0 not checked. [2018-04-10 16:11:10,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:10,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:10,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:11:10,743 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-04-10 16:11:10,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:10,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 9268 proven. 1161 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2018-04-10 16:11:11,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:11,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 41 [2018-04-10 16:11:11,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 16:11:11,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 16:11:11,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:11:11,303 INFO L87 Difference]: Start difference. First operand 552 states and 560 transitions. Second operand 41 states. [2018-04-10 16:11:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:12,367 INFO L93 Difference]: Finished difference Result 729 states and 743 transitions. [2018-04-10 16:11:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 16:11:12,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 527 [2018-04-10 16:11:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:12,369 INFO L225 Difference]: With dead ends: 729 [2018-04-10 16:11:12,370 INFO L226 Difference]: Without dead ends: 729 [2018-04-10 16:11:12,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=645, Invalid=3911, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:11:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-04-10 16:11:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 639. [2018-04-10 16:11:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-04-10 16:11:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 651 transitions. [2018-04-10 16:11:12,380 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 651 transitions. Word has length 527 [2018-04-10 16:11:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:12,381 INFO L459 AbstractCegarLoop]: Abstraction has 639 states and 651 transitions. [2018-04-10 16:11:12,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 16:11:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 651 transitions. [2018-04-10 16:11:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-04-10 16:11:12,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:12,387 INFO L355 BasicCegarLoop]: trace histogram [87, 77, 77, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:12,387 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1350141368, now seen corresponding path program 18 times [2018-04-10 16:11:12,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:12,388 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:12,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:12,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:12,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:12,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 9017 proven. 290 refuted. 0 times theorem prover too weak. 10227 trivial. 0 not checked. [2018-04-10 16:11:13,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:13,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:13,070 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:11:13,202 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-10 16:11:13,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:13,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:13,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:11:13,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:13,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:11:13,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:11:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 5134 proven. 334 refuted. 0 times theorem prover too weak. 14066 trivial. 0 not checked. [2018-04-10 16:11:14,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:14,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 41 [2018-04-10 16:11:14,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 16:11:14,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 16:11:14,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:11:14,245 INFO L87 Difference]: Start difference. First operand 639 states and 651 transitions. Second operand 41 states. [2018-04-10 16:11:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:16,316 INFO L93 Difference]: Finished difference Result 730 states and 738 transitions. [2018-04-10 16:11:16,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-10 16:11:16,316 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 593 [2018-04-10 16:11:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:16,318 INFO L225 Difference]: With dead ends: 730 [2018-04-10 16:11:16,318 INFO L226 Difference]: Without dead ends: 643 [2018-04-10 16:11:16,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 570 SyntacticMatches, 19 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6670 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2717, Invalid=13033, Unknown=0, NotChecked=0, Total=15750 [2018-04-10 16:11:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-04-10 16:11:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 630. [2018-04-10 16:11:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-04-10 16:11:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 635 transitions. [2018-04-10 16:11:16,327 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 635 transitions. Word has length 593 [2018-04-10 16:11:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:16,328 INFO L459 AbstractCegarLoop]: Abstraction has 630 states and 635 transitions. [2018-04-10 16:11:16,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 16:11:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 635 transitions. [2018-04-10 16:11:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-04-10 16:11:16,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:16,331 INFO L355 BasicCegarLoop]: trace histogram [100, 89, 89, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:16,331 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1742682151, now seen corresponding path program 19 times [2018-04-10 16:11:16,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:16,331 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:16,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:16,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:16,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:16,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 14286 proven. 1218 refuted. 0 times theorem prover too weak. 10489 trivial. 0 not checked. [2018-04-10 16:11:17,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:17,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:17,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:17,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 14315 proven. 1189 refuted. 0 times theorem prover too weak. 10489 trivial. 0 not checked. [2018-04-10 16:11:18,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:18,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 53 [2018-04-10 16:11:18,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 16:11:18,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 16:11:18,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2244, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 16:11:18,199 INFO L87 Difference]: Start difference. First operand 630 states and 635 transitions. Second operand 53 states. [2018-04-10 16:11:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:19,088 INFO L93 Difference]: Finished difference Result 651 states and 655 transitions. [2018-04-10 16:11:19,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 16:11:19,089 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 677 [2018-04-10 16:11:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:19,091 INFO L225 Difference]: With dead ends: 651 [2018-04-10 16:11:19,091 INFO L226 Difference]: Without dead ends: 645 [2018-04-10 16:11:19,092 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1910 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1539, Invalid=5943, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 16:11:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-04-10 16:11:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 636. [2018-04-10 16:11:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-04-10 16:11:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 640 transitions. [2018-04-10 16:11:19,100 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 640 transitions. Word has length 677 [2018-04-10 16:11:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:19,101 INFO L459 AbstractCegarLoop]: Abstraction has 636 states and 640 transitions. [2018-04-10 16:11:19,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 16:11:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 640 transitions. [2018-04-10 16:11:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-04-10 16:11:19,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:19,104 INFO L355 BasicCegarLoop]: trace histogram [101, 90, 90, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:19,104 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash -661149279, now seen corresponding path program 20 times [2018-04-10 16:11:19,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:19,104 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:19,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:19,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:19,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:19,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 26547 backedges. 6149 proven. 444 refuted. 0 times theorem prover too weak. 19954 trivial. 0 not checked. [2018-04-10 16:11:20,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:20,139 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:20,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:20,183 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:20,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:20,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:20,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:11:20,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:20,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:11:20,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:11:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 26547 backedges. 6149 proven. 444 refuted. 0 times theorem prover too weak. 19954 trivial. 0 not checked. [2018-04-10 16:11:20,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:20,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 19 [2018-04-10 16:11:20,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:11:20,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:11:20,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=233, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:11:20,960 INFO L87 Difference]: Start difference. First operand 636 states and 640 transitions. Second operand 20 states. [2018-04-10 16:11:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:21,281 INFO L93 Difference]: Finished difference Result 663 states and 669 transitions. [2018-04-10 16:11:21,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:11:21,281 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 683 [2018-04-10 16:11:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:21,283 INFO L225 Difference]: With dead ends: 663 [2018-04-10 16:11:21,283 INFO L226 Difference]: Without dead ends: 663 [2018-04-10 16:11:21,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 658 SyntacticMatches, 24 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=382, Invalid=674, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 16:11:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-04-10 16:11:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 642. [2018-04-10 16:11:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-04-10 16:11:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 647 transitions. [2018-04-10 16:11:21,288 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 647 transitions. Word has length 683 [2018-04-10 16:11:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:21,288 INFO L459 AbstractCegarLoop]: Abstraction has 642 states and 647 transitions. [2018-04-10 16:11:21,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:11:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 647 transitions. [2018-04-10 16:11:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-04-10 16:11:21,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:21,291 INFO L355 BasicCegarLoop]: trace histogram [102, 91, 91, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:21,291 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1048265559, now seen corresponding path program 21 times [2018-04-10 16:11:21,292 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:21,292 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:21,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:21,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:21,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:21,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 7115 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-10 16:11:22,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:22,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:22,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:22,186 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-04-10 16:11:22,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:22,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 11329 proven. 1408 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-10 16:11:22,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:22,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 58 [2018-04-10 16:11:22,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 16:11:22,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 16:11:22,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=2747, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 16:11:22,970 INFO L87 Difference]: Start difference. First operand 642 states and 647 transitions. Second operand 58 states. [2018-04-10 16:11:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:24,210 INFO L93 Difference]: Finished difference Result 745 states and 750 transitions. [2018-04-10 16:11:24,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 16:11:24,210 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 689 [2018-04-10 16:11:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:24,212 INFO L225 Difference]: With dead ends: 745 [2018-04-10 16:11:24,212 INFO L226 Difference]: Without dead ends: 745 [2018-04-10 16:11:24,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2022 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1661, Invalid=7459, Unknown=0, NotChecked=0, Total=9120 [2018-04-10 16:11:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-04-10 16:11:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 738. [2018-04-10 16:11:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-04-10 16:11:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 743 transitions. [2018-04-10 16:11:24,219 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 743 transitions. Word has length 689 [2018-04-10 16:11:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:24,219 INFO L459 AbstractCegarLoop]: Abstraction has 738 states and 743 transitions. [2018-04-10 16:11:24,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 16:11:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 743 transitions. [2018-04-10 16:11:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-04-10 16:11:24,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:24,223 INFO L355 BasicCegarLoop]: trace histogram [116, 104, 104, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:24,223 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 861490130, now seen corresponding path program 22 times [2018-04-10 16:11:24,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:24,223 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:24,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:24,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:24,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:24,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 35278 backedges. 7728 proven. 520 refuted. 0 times theorem prover too weak. 27030 trivial. 0 not checked. [2018-04-10 16:11:25,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:25,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:25,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:25,757 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:25,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:25,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:25,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:11:25,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:25,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:11:25,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:11:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 35278 backedges. 7728 proven. 520 refuted. 0 times theorem prover too weak. 27030 trivial. 0 not checked. [2018-04-10 16:11:27,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:27,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-04-10 16:11:27,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 16:11:27,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 16:11:27,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=961, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:11:27,212 INFO L87 Difference]: Start difference. First operand 738 states and 743 transitions. Second operand 37 states. [2018-04-10 16:11:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:27,675 INFO L93 Difference]: Finished difference Result 752 states and 758 transitions. [2018-04-10 16:11:27,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:11:27,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 779 [2018-04-10 16:11:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:27,677 INFO L225 Difference]: With dead ends: 752 [2018-04-10 16:11:27,677 INFO L226 Difference]: Without dead ends: 752 [2018-04-10 16:11:27,677 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 738 SyntacticMatches, 24 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=755, Invalid=1795, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 16:11:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-04-10 16:11:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 744. [2018-04-10 16:11:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-04-10 16:11:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 750 transitions. [2018-04-10 16:11:27,683 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 750 transitions. Word has length 779 [2018-04-10 16:11:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:27,683 INFO L459 AbstractCegarLoop]: Abstraction has 744 states and 750 transitions. [2018-04-10 16:11:27,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 16:11:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 750 transitions. [2018-04-10 16:11:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2018-04-10 16:11:27,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:27,687 INFO L355 BasicCegarLoop]: trace histogram [117, 105, 105, 104, 104, 104, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:27,687 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash 420886042, now seen corresponding path program 23 times [2018-04-10 16:11:27,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:27,687 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:27,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:27,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:27,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:27,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 35924 backedges. 8853 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-04-10 16:11:28,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:28,779 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:28,780 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:11:29,663 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-04-10 16:11:29,663 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:29,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 35924 backedges. 12804 proven. 6711 refuted. 0 times theorem prover too weak. 16409 trivial. 0 not checked. [2018-04-10 16:11:30,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:30,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 49] total 66 [2018-04-10 16:11:30,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 16:11:30,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 16:11:30,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=3725, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 16:11:30,705 INFO L87 Difference]: Start difference. First operand 744 states and 750 transitions. Second operand 66 states. [2018-04-10 16:11:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:32,453 INFO L93 Difference]: Finished difference Result 952 states and 963 transitions. [2018-04-10 16:11:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 16:11:32,453 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 785 [2018-04-10 16:11:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:32,455 INFO L225 Difference]: With dead ends: 952 [2018-04-10 16:11:32,455 INFO L226 Difference]: Without dead ends: 952 [2018-04-10 16:11:32,455 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1409, Invalid=8893, Unknown=0, NotChecked=0, Total=10302 [2018-04-10 16:11:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-04-10 16:11:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 942. [2018-04-10 16:11:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-04-10 16:11:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 953 transitions. [2018-04-10 16:11:32,464 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 953 transitions. Word has length 785 [2018-04-10 16:11:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:32,464 INFO L459 AbstractCegarLoop]: Abstraction has 942 states and 953 transitions. [2018-04-10 16:11:32,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 16:11:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 953 transitions. [2018-04-10 16:11:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2018-04-10 16:11:32,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:32,468 INFO L355 BasicCegarLoop]: trace histogram [130, 117, 117, 116, 116, 116, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:32,468 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash -782704581, now seen corresponding path program 24 times [2018-04-10 16:11:32,469 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:32,469 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:32,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:32,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:32,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:32,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 18991 proven. 4099 refuted. 0 times theorem prover too weak. 21437 trivial. 0 not checked. [2018-04-10 16:11:33,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:33,812 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:33,813 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:11:34,025 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-10 16:11:34,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:34,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:34,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:11:34,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:34,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:11:34,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:11:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 9965 proven. 4736 refuted. 0 times theorem prover too weak. 29826 trivial. 0 not checked. [2018-04-10 16:11:35,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:35,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 58 [2018-04-10 16:11:35,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 16:11:35,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 16:11:35,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2859, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 16:11:35,786 INFO L87 Difference]: Start difference. First operand 942 states and 953 transitions. Second operand 58 states. [2018-04-10 16:11:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:39,064 INFO L93 Difference]: Finished difference Result 1060 states and 1072 transitions. [2018-04-10 16:11:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-10 16:11:39,064 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 869 [2018-04-10 16:11:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:39,066 INFO L225 Difference]: With dead ends: 1060 [2018-04-10 16:11:39,067 INFO L226 Difference]: Without dead ends: 1048 [2018-04-10 16:11:39,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 821 SyntacticMatches, 24 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6707 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2375, Invalid=15447, Unknown=0, NotChecked=0, Total=17822 [2018-04-10 16:11:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-04-10 16:11:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 924. [2018-04-10 16:11:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-04-10 16:11:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 930 transitions. [2018-04-10 16:11:39,080 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 930 transitions. Word has length 869 [2018-04-10 16:11:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:39,081 INFO L459 AbstractCegarLoop]: Abstraction has 924 states and 930 transitions. [2018-04-10 16:11:39,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 16:11:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 930 transitions. [2018-04-10 16:11:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 966 [2018-04-10 16:11:39,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:39,089 INFO L355 BasicCegarLoop]: trace histogram [145, 131, 131, 130, 130, 130, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:39,090 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -422042836, now seen corresponding path program 25 times [2018-04-10 16:11:39,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:39,090 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:39,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:39,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:39,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:39,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55660 backedges. 21823 proven. 5232 refuted. 0 times theorem prover too weak. 28605 trivial. 0 not checked. [2018-04-10 16:11:40,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:40,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:40,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:40,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 55660 backedges. 29333 proven. 3221 refuted. 0 times theorem prover too weak. 23106 trivial. 0 not checked. [2018-04-10 16:11:41,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:41,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 59 [2018-04-10 16:11:41,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 16:11:41,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 16:11:41,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2814, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 16:11:41,598 INFO L87 Difference]: Start difference. First operand 924 states and 930 transitions. Second operand 59 states. [2018-04-10 16:11:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:42,555 INFO L93 Difference]: Finished difference Result 948 states and 952 transitions. [2018-04-10 16:11:42,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 16:11:42,555 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 965 [2018-04-10 16:11:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:42,557 INFO L225 Difference]: With dead ends: 948 [2018-04-10 16:11:42,557 INFO L226 Difference]: Without dead ends: 939 [2018-04-10 16:11:42,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1902, Invalid=7410, Unknown=0, NotChecked=0, Total=9312 [2018-04-10 16:11:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-04-10 16:11:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 930. [2018-04-10 16:11:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-04-10 16:11:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 934 transitions. [2018-04-10 16:11:42,564 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 934 transitions. Word has length 965 [2018-04-10 16:11:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:42,565 INFO L459 AbstractCegarLoop]: Abstraction has 930 states and 934 transitions. [2018-04-10 16:11:42,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 16:11:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 934 transitions. [2018-04-10 16:11:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2018-04-10 16:11:42,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:42,573 INFO L355 BasicCegarLoop]: trace histogram [147, 133, 133, 132, 132, 132, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:42,574 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1407253252, now seen corresponding path program 26 times [2018-04-10 16:11:42,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:42,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:42,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:42,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:42,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:42,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 57290 backedges. 23738 proven. 4377 refuted. 0 times theorem prover too weak. 29175 trivial. 0 not checked. [2018-04-10 16:11:44,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:44,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:44,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:44,457 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:44,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:44,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 57290 backedges. 23767 proven. 4348 refuted. 0 times theorem prover too weak. 29175 trivial. 0 not checked. [2018-04-10 16:11:45,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:45,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 62 [2018-04-10 16:11:45,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 16:11:45,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 16:11:45,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3120, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 16:11:45,233 INFO L87 Difference]: Start difference. First operand 930 states and 934 transitions. Second operand 62 states. [2018-04-10 16:11:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:46,315 INFO L93 Difference]: Finished difference Result 958 states and 962 transitions. [2018-04-10 16:11:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 16:11:46,315 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 977 [2018-04-10 16:11:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:46,317 INFO L225 Difference]: With dead ends: 958 [2018-04-10 16:11:46,317 INFO L226 Difference]: Without dead ends: 952 [2018-04-10 16:11:46,317 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2100, Invalid=8202, Unknown=0, NotChecked=0, Total=10302 [2018-04-10 16:11:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-04-10 16:11:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 940. [2018-04-10 16:11:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-04-10 16:11:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 944 transitions. [2018-04-10 16:11:46,323 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 944 transitions. Word has length 977 [2018-04-10 16:11:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:46,323 INFO L459 AbstractCegarLoop]: Abstraction has 940 states and 944 transitions. [2018-04-10 16:11:46,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 16:11:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 944 transitions. [2018-04-10 16:11:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2018-04-10 16:11:46,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:46,331 INFO L355 BasicCegarLoop]: trace histogram [148, 134, 134, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:46,332 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash -642834300, now seen corresponding path program 27 times [2018-04-10 16:11:46,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:46,332 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:46,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:46,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:46,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:46,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 10906 proven. 602 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-04-10 16:11:47,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:47,973 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:48,030 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-04-10 16:11:48,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:48,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:48,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:11:48,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:48,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:11:48,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:11:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 10906 proven. 602 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-04-10 16:11:49,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:49,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-04-10 16:11:49,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:11:49,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:11:49,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=280, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:11:49,205 INFO L87 Difference]: Start difference. First operand 940 states and 944 transitions. Second operand 22 states. [2018-04-10 16:11:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:49,530 INFO L93 Difference]: Finished difference Result 951 states and 955 transitions. [2018-04-10 16:11:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:11:49,530 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 983 [2018-04-10 16:11:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:49,532 INFO L225 Difference]: With dead ends: 951 [2018-04-10 16:11:49,532 INFO L226 Difference]: Without dead ends: 951 [2018-04-10 16:11:49,532 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 952 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=849, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:11:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-04-10 16:11:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 942. [2018-04-10 16:11:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-04-10 16:11:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 946 transitions. [2018-04-10 16:11:49,537 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 946 transitions. Word has length 983 [2018-04-10 16:11:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:49,538 INFO L459 AbstractCegarLoop]: Abstraction has 942 states and 946 transitions. [2018-04-10 16:11:49,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:11:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 946 transitions. [2018-04-10 16:11:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-04-10 16:11:49,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:49,543 INFO L355 BasicCegarLoop]: trace histogram [149, 135, 135, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:49,543 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:49,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1557282124, now seen corresponding path program 28 times [2018-04-10 16:11:49,543 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:49,543 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:49,544 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:49,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:49,544 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:49,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 11648 proven. 690 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-04-10 16:11:51,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:51,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:51,687 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:51,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:51,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:51,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:11:51,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:51,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:11:51,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:11:51,789 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:11:51,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:11:51,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:11:51,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-04-10 16:11:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 25212 proven. 7364 refuted. 0 times theorem prover too weak. 26368 trivial. 0 not checked. [2018-04-10 16:11:54,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:54,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 47] total 65 [2018-04-10 16:11:54,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 16:11:54,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 16:11:54,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3812, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 16:11:54,091 INFO L87 Difference]: Start difference. First operand 942 states and 946 transitions. Second operand 66 states. [2018-04-10 16:11:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:58,057 INFO L93 Difference]: Finished difference Result 971 states and 977 transitions. [2018-04-10 16:11:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 16:11:58,057 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 989 [2018-04-10 16:11:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:58,059 INFO L225 Difference]: With dead ends: 971 [2018-04-10 16:11:58,059 INFO L226 Difference]: Without dead ends: 971 [2018-04-10 16:11:58,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 917 SyntacticMatches, 29 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1997, Invalid=15559, Unknown=0, NotChecked=0, Total=17556 [2018-04-10 16:11:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-04-10 16:11:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 948. [2018-04-10 16:11:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-04-10 16:11:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 953 transitions. [2018-04-10 16:11:58,065 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 953 transitions. Word has length 989 [2018-04-10 16:11:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:58,065 INFO L459 AbstractCegarLoop]: Abstraction has 948 states and 953 transitions. [2018-04-10 16:11:58,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 16:11:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 953 transitions. [2018-04-10 16:11:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-04-10 16:11:58,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:58,070 INFO L355 BasicCegarLoop]: trace histogram [150, 136, 136, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:58,070 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:11:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1007592468, now seen corresponding path program 29 times [2018-04-10 16:11:58,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:58,071 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:58,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:58,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:58,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:58,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 59780 backedges. 12390 proven. 784 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-04-10 16:11:59,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:59,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:59,894 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:12:01,247 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-04-10 16:12:01,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:01,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 59780 backedges. 15400 proven. 5549 refuted. 0 times theorem prover too weak. 38831 trivial. 0 not checked. [2018-04-10 16:12:02,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:02,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 40] total 60 [2018-04-10 16:12:02,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 16:12:02,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 16:12:02,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=3055, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 16:12:02,524 INFO L87 Difference]: Start difference. First operand 948 states and 953 transitions. Second operand 60 states. [2018-04-10 16:12:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:04,661 INFO L93 Difference]: Finished difference Result 1087 states and 1094 transitions. [2018-04-10 16:12:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 16:12:04,661 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 995 [2018-04-10 16:12:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:04,663 INFO L225 Difference]: With dead ends: 1087 [2018-04-10 16:12:04,663 INFO L226 Difference]: Without dead ends: 1087 [2018-04-10 16:12:04,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 957 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3418 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2212, Invalid=11128, Unknown=0, NotChecked=0, Total=13340 [2018-04-10 16:12:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-04-10 16:12:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1068. [2018-04-10 16:12:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-04-10 16:12:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1075 transitions. [2018-04-10 16:12:04,671 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1075 transitions. Word has length 995 [2018-04-10 16:12:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:04,671 INFO L459 AbstractCegarLoop]: Abstraction has 1068 states and 1075 transitions. [2018-04-10 16:12:04,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 16:12:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1075 transitions. [2018-04-10 16:12:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-04-10 16:12:04,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:04,677 INFO L355 BasicCegarLoop]: trace histogram [167, 152, 152, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:04,678 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1753664213, now seen corresponding path program 30 times [2018-04-10 16:12:04,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:04,678 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:04,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:04,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:04,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:04,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 29764 proven. 5578 refuted. 0 times theorem prover too weak. 39107 trivial. 0 not checked. [2018-04-10 16:12:06,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:06,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:06,961 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:12:07,355 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-04-10 16:12:07,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:07,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:07,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:12:07,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:12:07,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:12:07,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:12:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 14759 proven. 724 refuted. 0 times theorem prover too weak. 58966 trivial. 0 not checked. [2018-04-10 16:12:09,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:09,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 23] total 60 [2018-04-10 16:12:09,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 16:12:09,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 16:12:09,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3075, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 16:12:09,539 INFO L87 Difference]: Start difference. First operand 1068 states and 1075 transitions. Second operand 60 states. [2018-04-10 16:12:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:12,167 INFO L93 Difference]: Finished difference Result 1201 states and 1208 transitions. [2018-04-10 16:12:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-10 16:12:12,168 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1103 [2018-04-10 16:12:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:12,170 INFO L225 Difference]: With dead ends: 1201 [2018-04-10 16:12:12,170 INFO L226 Difference]: Without dead ends: 1192 [2018-04-10 16:12:12,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1054 SyntacticMatches, 29 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6874 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2465, Invalid=15895, Unknown=0, NotChecked=0, Total=18360 [2018-04-10 16:12:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-04-10 16:12:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1176. [2018-04-10 16:12:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-04-10 16:12:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1182 transitions. [2018-04-10 16:12:12,176 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1182 transitions. Word has length 1103 [2018-04-10 16:12:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:12,177 INFO L459 AbstractCegarLoop]: Abstraction has 1176 states and 1182 transitions. [2018-04-10 16:12:12,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 16:12:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1182 transitions. [2018-04-10 16:12:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2018-04-10 16:12:12,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:12,183 INFO L355 BasicCegarLoop]: trace histogram [185, 169, 169, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:12,183 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -230054690, now seen corresponding path program 31 times [2018-04-10 16:12:12,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:12,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:12,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:12,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:12,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:12,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 33976 proven. 6853 refuted. 0 times theorem prover too weak. 50939 trivial. 0 not checked. [2018-04-10 16:12:14,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:14,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:14,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:12:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:15,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 34005 proven. 6824 refuted. 0 times theorem prover too weak. 50939 trivial. 0 not checked. [2018-04-10 16:12:16,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:16,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 68 [2018-04-10 16:12:16,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 16:12:16,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 16:12:16,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=3774, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:12:16,038 INFO L87 Difference]: Start difference. First operand 1176 states and 1182 transitions. Second operand 68 states. [2018-04-10 16:12:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:17,242 INFO L93 Difference]: Finished difference Result 1200 states and 1205 transitions. [2018-04-10 16:12:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 16:12:17,242 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1217 [2018-04-10 16:12:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:17,244 INFO L225 Difference]: With dead ends: 1200 [2018-04-10 16:12:17,244 INFO L226 Difference]: Without dead ends: 1194 [2018-04-10 16:12:17,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1301 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2529, Invalid=9903, Unknown=0, NotChecked=0, Total=12432 [2018-04-10 16:12:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-04-10 16:12:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1182. [2018-04-10 16:12:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-04-10 16:12:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1187 transitions. [2018-04-10 16:12:17,251 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1187 transitions. Word has length 1217 [2018-04-10 16:12:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:17,251 INFO L459 AbstractCegarLoop]: Abstraction has 1182 states and 1187 transitions. [2018-04-10 16:12:17,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-10 16:12:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1187 transitions. [2018-04-10 16:12:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2018-04-10 16:12:17,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:17,258 INFO L355 BasicCegarLoop]: trace histogram [186, 170, 170, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:17,258 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -929947930, now seen corresponding path program 32 times [2018-04-10 16:12:17,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:17,258 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:17,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:17,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:12:17,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:17,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16704 proven. 884 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-04-10 16:12:19,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:19,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:19,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:12:19,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:12:19,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:19,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:19,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:12:19,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:12:19,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:12:19,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:12:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16704 proven. 884 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-04-10 16:12:21,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:21,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 24 [2018-04-10 16:12:21,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:12:21,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:12:21,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=358, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:12:21,986 INFO L87 Difference]: Start difference. First operand 1182 states and 1187 transitions. Second operand 25 states. [2018-04-10 16:12:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:22,431 INFO L93 Difference]: Finished difference Result 1212 states and 1219 transitions. [2018-04-10 16:12:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:12:22,431 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1223 [2018-04-10 16:12:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:22,434 INFO L225 Difference]: With dead ends: 1212 [2018-04-10 16:12:22,434 INFO L226 Difference]: Without dead ends: 1212 [2018-04-10 16:12:22,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1188 SyntacticMatches, 34 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=657, Invalid=1149, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 16:12:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2018-04-10 16:12:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1188. [2018-04-10 16:12:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2018-04-10 16:12:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1194 transitions. [2018-04-10 16:12:22,441 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1194 transitions. Word has length 1223 [2018-04-10 16:12:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:22,442 INFO L459 AbstractCegarLoop]: Abstraction has 1188 states and 1194 transitions. [2018-04-10 16:12:22,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:12:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1194 transitions. [2018-04-10 16:12:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-04-10 16:12:22,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:22,452 INFO L355 BasicCegarLoop]: trace histogram [187, 171, 171, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:22,452 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -920557010, now seen corresponding path program 33 times [2018-04-10 16:12:22,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:22,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:22,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:22,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:22,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:22,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 18585 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-04-10 16:12:25,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:25,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:25,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:12:25,381 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-04-10 16:12:25,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:25,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 31449 proven. 2758 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-10 16:12:26,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:26,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43] total 78 [2018-04-10 16:12:26,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 16:12:26,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 16:12:26,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=5012, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 16:12:26,709 INFO L87 Difference]: Start difference. First operand 1188 states and 1194 transitions. Second operand 78 states. [2018-04-10 16:12:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:28,395 INFO L93 Difference]: Finished difference Result 1324 states and 1330 transitions. [2018-04-10 16:12:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-10 16:12:28,395 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1229 [2018-04-10 16:12:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:28,397 INFO L225 Difference]: With dead ends: 1324 [2018-04-10 16:12:28,398 INFO L226 Difference]: Without dead ends: 1324 [2018-04-10 16:12:28,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1321 GetRequests, 1192 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2976, Invalid=14054, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 16:12:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2018-04-10 16:12:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1314. [2018-04-10 16:12:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-04-10 16:12:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1320 transitions. [2018-04-10 16:12:28,406 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1320 transitions. Word has length 1229 [2018-04-10 16:12:28,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:28,406 INFO L459 AbstractCegarLoop]: Abstraction has 1314 states and 1320 transitions. [2018-04-10 16:12:28,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 16:12:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1320 transitions. [2018-04-10 16:12:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2018-04-10 16:12:28,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:28,415 INFO L355 BasicCegarLoop]: trace histogram [206, 189, 189, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:28,415 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:28,415 INFO L82 PathProgramCache]: Analyzing trace with hash -616680001, now seen corresponding path program 34 times [2018-04-10 16:12:28,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:28,415 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:28,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:28,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:28,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:28,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 114363 backedges. 19703 proven. 990 refuted. 0 times theorem prover too weak. 93670 trivial. 0 not checked. [2018-04-10 16:12:31,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:31,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:12:32,600 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:12:32,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:32,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:32,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:12:32,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:12:32,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:12:32,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:12:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 114363 backedges. 19703 proven. 990 refuted. 0 times theorem prover too weak. 93670 trivial. 0 not checked. [2018-04-10 16:12:35,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:35,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-04-10 16:12:35,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 16:12:35,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 16:12:35,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=1526, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 16:12:35,052 INFO L87 Difference]: Start difference. First operand 1314 states and 1320 transitions. Second operand 47 states. [2018-04-10 16:12:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:35,703 INFO L93 Difference]: Finished difference Result 1331 states and 1338 transitions. [2018-04-10 16:12:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:12:35,704 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1349 [2018-04-10 16:12:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:35,706 INFO L225 Difference]: With dead ends: 1331 [2018-04-10 16:12:35,706 INFO L226 Difference]: Without dead ends: 1331 [2018-04-10 16:12:35,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1391 GetRequests, 1293 SyntacticMatches, 34 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1300, Invalid=2990, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 16:12:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2018-04-10 16:12:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1320. [2018-04-10 16:12:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-04-10 16:12:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1327 transitions. [2018-04-10 16:12:35,714 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1327 transitions. Word has length 1349 [2018-04-10 16:12:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:35,715 INFO L459 AbstractCegarLoop]: Abstraction has 1320 states and 1327 transitions. [2018-04-10 16:12:35,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 16:12:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1327 transitions. [2018-04-10 16:12:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2018-04-10 16:12:35,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:35,729 INFO L355 BasicCegarLoop]: trace histogram [207, 190, 190, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:35,729 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:35,729 INFO L82 PathProgramCache]: Analyzing trace with hash -888325561, now seen corresponding path program 35 times [2018-04-10 16:12:35,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:35,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:35,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:35,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:35,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:35,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 115529 backedges. 21803 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-04-10 16:12:39,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:39,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:39,141 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:12:42,644 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-04-10 16:12:42,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:43,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 115529 backedges. 25975 proven. 9034 refuted. 0 times theorem prover too weak. 80520 trivial. 0 not checked. [2018-04-10 16:12:44,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:44,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 46] total 76 [2018-04-10 16:12:44,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-10 16:12:44,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-10 16:12:44,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=4709, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 16:12:44,567 INFO L87 Difference]: Start difference. First operand 1320 states and 1327 transitions. Second operand 76 states. [2018-04-10 16:12:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:46,297 INFO L93 Difference]: Finished difference Result 1591 states and 1603 transitions. [2018-04-10 16:12:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-10 16:12:46,297 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1355 [2018-04-10 16:12:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:46,300 INFO L225 Difference]: With dead ends: 1591 [2018-04-10 16:12:46,300 INFO L226 Difference]: Without dead ends: 1591 [2018-04-10 16:12:46,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1445 GetRequests, 1322 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3487 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2740, Invalid=12760, Unknown=0, NotChecked=0, Total=15500 [2018-04-10 16:12:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-04-10 16:12:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1578. [2018-04-10 16:12:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2018-04-10 16:12:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1590 transitions. [2018-04-10 16:12:46,311 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1590 transitions. Word has length 1355 [2018-04-10 16:12:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:46,312 INFO L459 AbstractCegarLoop]: Abstraction has 1578 states and 1590 transitions. [2018-04-10 16:12:46,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-10 16:12:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1590 transitions. [2018-04-10 16:12:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1470 [2018-04-10 16:12:46,322 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:46,322 INFO L355 BasicCegarLoop]: trace histogram [225, 207, 207, 206, 206, 206, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:46,322 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2030739248, now seen corresponding path program 36 times [2018-04-10 16:12:46,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:46,323 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:46,323 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:46,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:46,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:46,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 42961 proven. 11364 refuted. 0 times theorem prover too weak. 82567 trivial. 0 not checked. [2018-04-10 16:12:50,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:50,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:12:52,323 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-04-10 16:12:52,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:52,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:12:52,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:12:52,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:12:52,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:12:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 33142 proven. 8228 refuted. 0 times theorem prover too weak. 95522 trivial. 0 not checked. [2018-04-10 16:12:55,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:55,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30] total 71 [2018-04-10 16:12:55,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 16:12:55,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 16:12:55,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=4349, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 16:12:55,912 INFO L87 Difference]: Start difference. First operand 1578 states and 1590 transitions. Second operand 71 states. [2018-04-10 16:12:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:59,782 INFO L93 Difference]: Finished difference Result 1472 states and 1479 transitions. [2018-04-10 16:12:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-10 16:12:59,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1469 [2018-04-10 16:12:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:59,785 INFO L225 Difference]: With dead ends: 1472 [2018-04-10 16:12:59,785 INFO L226 Difference]: Without dead ends: 1463 [2018-04-10 16:12:59,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1595 GetRequests, 1407 SyntacticMatches, 35 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7204 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3750, Invalid=20120, Unknown=0, NotChecked=0, Total=23870 [2018-04-10 16:12:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2018-04-10 16:12:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1446. [2018-04-10 16:12:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2018-04-10 16:12:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1453 transitions. [2018-04-10 16:12:59,792 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1453 transitions. Word has length 1469 [2018-04-10 16:12:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:59,793 INFO L459 AbstractCegarLoop]: Abstraction has 1446 states and 1453 transitions. [2018-04-10 16:12:59,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 16:12:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1453 transitions. [2018-04-10 16:12:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1482 [2018-04-10 16:12:59,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:59,802 INFO L355 BasicCegarLoop]: trace histogram [227, 209, 209, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:59,802 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:12:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 177292256, now seen corresponding path program 37 times [2018-04-10 16:12:59,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:59,802 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:59,803 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:59,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:59,803 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:59,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 47146 proven. 9625 refuted. 0 times theorem prover too weak. 82679 trivial. 0 not checked. [2018-04-10 16:13:04,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:04,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:04,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:13:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:04,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 47175 proven. 9596 refuted. 0 times theorem prover too weak. 82679 trivial. 0 not checked. [2018-04-10 16:13:05,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:05,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 74 [2018-04-10 16:13:05,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 16:13:05,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 16:13:05,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=918, Invalid=4484, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 16:13:05,622 INFO L87 Difference]: Start difference. First operand 1446 states and 1453 transitions. Second operand 74 states. [2018-04-10 16:13:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:07,005 INFO L93 Difference]: Finished difference Result 1458 states and 1463 transitions. [2018-04-10 16:13:07,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 16:13:07,005 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1481 [2018-04-10 16:13:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:07,008 INFO L225 Difference]: With dead ends: 1458 [2018-04-10 16:13:07,008 INFO L226 Difference]: Without dead ends: 1452 [2018-04-10 16:13:07,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1573 GetRequests, 1453 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3002, Invalid=11760, Unknown=0, NotChecked=0, Total=14762 [2018-04-10 16:13:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2018-04-10 16:13:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1446. [2018-04-10 16:13:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2018-04-10 16:13:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1451 transitions. [2018-04-10 16:13:07,018 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1451 transitions. Word has length 1481 [2018-04-10 16:13:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:07,018 INFO L459 AbstractCegarLoop]: Abstraction has 1446 states and 1451 transitions. [2018-04-10 16:13:07,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 16:13:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1451 transitions. [2018-04-10 16:13:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2018-04-10 16:13:07,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:07,028 INFO L355 BasicCegarLoop]: trace histogram [228, 210, 210, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:07,028 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:13:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1607842712, now seen corresponding path program 38 times [2018-04-10 16:13:07,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:07,028 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:07,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:07,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:13:07,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:07,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 25371 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-10 16:13:11,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:11,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:11,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:13:11,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:13:11,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:11,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 43627 proven. 3424 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-04-10 16:13:13,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:13,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 47] total 86 [2018-04-10 16:13:13,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-10 16:13:13,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-10 16:13:13,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1203, Invalid=6107, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 16:13:13,187 INFO L87 Difference]: Start difference. First operand 1446 states and 1451 transitions. Second operand 86 states. [2018-04-10 16:13:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:15,245 INFO L93 Difference]: Finished difference Result 1594 states and 1600 transitions. [2018-04-10 16:13:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-10 16:13:15,245 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1487 [2018-04-10 16:13:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:15,248 INFO L225 Difference]: With dead ends: 1594 [2018-04-10 16:13:15,248 INFO L226 Difference]: Without dead ends: 1594 [2018-04-10 16:13:15,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1589 GetRequests, 1446 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4864 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3607, Invalid=17273, Unknown=0, NotChecked=0, Total=20880 [2018-04-10 16:13:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2018-04-10 16:13:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1584. [2018-04-10 16:13:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2018-04-10 16:13:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1590 transitions. [2018-04-10 16:13:15,257 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1590 transitions. Word has length 1487 [2018-04-10 16:13:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:15,257 INFO L459 AbstractCegarLoop]: Abstraction has 1584 states and 1590 transitions. [2018-04-10 16:13:15,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-10 16:13:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1590 transitions. [2018-04-10 16:13:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2018-04-10 16:13:15,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:15,268 INFO L355 BasicCegarLoop]: trace histogram [249, 230, 230, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:15,268 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:13:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2037889527, now seen corresponding path program 39 times [2018-04-10 16:13:15,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:15,268 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:15,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:15,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:15,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:15,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 26733 proven. 1220 refuted. 0 times theorem prover too weak. 140486 trivial. 0 not checked. [2018-04-10 16:13:19,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:19,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:19,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:13:19,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-04-10 16:13:19,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:19,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:19,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:13:19,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:13:19,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:13:19,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:13:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 26733 proven. 1220 refuted. 0 times theorem prover too weak. 140486 trivial. 0 not checked. [2018-04-10 16:13:22,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:22,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 27 [2018-04-10 16:13:22,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:13:22,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:13:22,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=445, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:13:22,704 INFO L87 Difference]: Start difference. First operand 1584 states and 1590 transitions. Second operand 28 states. [2018-04-10 16:13:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:23,236 INFO L93 Difference]: Finished difference Result 1601 states and 1608 transitions. [2018-04-10 16:13:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:13:23,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1619 [2018-04-10 16:13:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:23,241 INFO L225 Difference]: With dead ends: 1601 [2018-04-10 16:13:23,241 INFO L226 Difference]: Without dead ends: 1601 [2018-04-10 16:13:23,241 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 1578 SyntacticMatches, 40 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=858, Invalid=1494, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 16:13:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2018-04-10 16:13:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1590. [2018-04-10 16:13:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2018-04-10 16:13:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 1597 transitions. [2018-04-10 16:13:23,253 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 1597 transitions. Word has length 1619 [2018-04-10 16:13:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:23,253 INFO L459 AbstractCegarLoop]: Abstraction has 1590 states and 1597 transitions. [2018-04-10 16:13:23,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:13:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1597 transitions. [2018-04-10 16:13:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2018-04-10 16:13:23,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:23,264 INFO L355 BasicCegarLoop]: trace histogram [250, 231, 231, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:23,264 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:13:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash 85486353, now seen corresponding path program 40 times [2018-04-10 16:13:23,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:23,265 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:23,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:23,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:23,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:23,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 169855 backedges. 29307 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-10 16:13:28,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:28,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:28,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:13:28,654 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:13:28,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:28,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 169855 backedges. 47556 proven. 5909 refuted. 0 times theorem prover too weak. 116390 trivial. 0 not checked. [2018-04-10 16:13:30,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:30,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 49] total 89 [2018-04-10 16:13:30,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-10 16:13:30,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-10 16:13:30,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1293, Invalid=6539, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 16:13:30,535 INFO L87 Difference]: Start difference. First operand 1590 states and 1597 transitions. Second operand 89 states. [2018-04-10 16:13:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:32,446 INFO L93 Difference]: Finished difference Result 1742 states and 1751 transitions. [2018-04-10 16:13:32,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-10 16:13:32,446 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1625 [2018-04-10 16:13:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:32,449 INFO L225 Difference]: With dead ends: 1742 [2018-04-10 16:13:32,449 INFO L226 Difference]: Without dead ends: 1742 [2018-04-10 16:13:32,450 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1731 GetRequests, 1583 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5223 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3833, Invalid=18517, Unknown=0, NotChecked=0, Total=22350 [2018-04-10 16:13:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2018-04-10 16:13:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1731. [2018-04-10 16:13:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-04-10 16:13:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 1740 transitions. [2018-04-10 16:13:32,459 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 1740 transitions. Word has length 1625 [2018-04-10 16:13:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:32,460 INFO L459 AbstractCegarLoop]: Abstraction has 1731 states and 1740 transitions. [2018-04-10 16:13:32,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-10 16:13:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 1740 transitions. [2018-04-10 16:13:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2018-04-10 16:13:32,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:32,473 INFO L355 BasicCegarLoop]: trace histogram [271, 251, 251, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:32,473 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:13:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1662420850, now seen corresponding path program 41 times [2018-04-10 16:13:32,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:32,473 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:32,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:32,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:32,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:32,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 76348 proven. 6069 refuted. 0 times theorem prover too weak. 117753 trivial. 0 not checked. [2018-04-10 16:13:39,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:39,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... [2018-04-10 16:13:40,570 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-04-10 16:13:40,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-10 16:13:40,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:13:40,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 16:13:40,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 16:13:40,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 16:13:40,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=1779, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 16:13:40,863 INFO L87 Difference]: Start difference. First operand 1731 states and 1740 transitions. Second operand 48 states. [2018-04-10 16:13:40,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 16:13:40,864 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:13:40,868 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:13:40,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:13:40 BoogieIcfgContainer [2018-04-10 16:13:40,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:13:40,869 INFO L168 Benchmark]: Toolchain (without parser) took 173798.03 ms. Allocated memory was 402.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 341.1 MB in the beginning and 947.3 MB in the end (delta: -606.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-10 16:13:40,870 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 402.1 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:13:40,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.83 ms. Allocated memory is still 402.1 MB. Free memory was 341.1 MB in the beginning and 330.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:13:40,870 INFO L168 Benchmark]: Boogie Preprocessor took 28.18 ms. Allocated memory is still 402.1 MB. Free memory was 330.4 MB in the beginning and 329.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:13:40,870 INFO L168 Benchmark]: RCFGBuilder took 241.49 ms. Allocated memory was 402.1 MB in the beginning and 616.6 MB in the end (delta: 214.4 MB). Free memory was 329.1 MB in the beginning and 580.6 MB in the end (delta: -251.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:13:40,871 INFO L168 Benchmark]: TraceAbstraction took 173348.85 ms. Allocated memory was 616.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 578.9 MB in the beginning and 947.3 MB in the end (delta: -368.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-10 16:13:40,872 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 402.1 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.83 ms. Allocated memory is still 402.1 MB. Free memory was 341.1 MB in the beginning and 330.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.18 ms. Allocated memory is still 402.1 MB. Free memory was 330.4 MB in the beginning and 329.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 241.49 ms. Allocated memory was 402.1 MB in the beginning and 616.6 MB in the end (delta: 214.4 MB). Free memory was 329.1 MB in the beginning and 580.6 MB in the end (delta: -251.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 173348.85 ms. Allocated memory was 616.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 578.9 MB in the beginning and 947.3 MB in the end (delta: -368.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1731states) and interpolant automaton (currently 2 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1731states) and interpolant automaton (currently 2 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1731states) and interpolant automaton (currently 2 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (1731states) and interpolant automaton (currently 2 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1731states) and interpolant automaton (currently 2 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (1731states) and interpolant automaton (currently 2 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 173.3s OverallTime, 49 OverallIterations, 271 TraceHistogramMax, 47.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1598 SDtfs, 25224 SDslu, 18757 SDs, 0 SdLazy, 59226 SolverSat, 3925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32250 GetRequests, 28670 SyntacticMatches, 395 SemanticMatches, 3185 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88980 ImplicationChecksByTransitivity, 53.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1731occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 48 MinimizatonAttempts, 1013 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 15.2s SatisfiabilityAnalysisTime, 97.7s InterpolantComputationTime, 63207 NumberOfCodeBlocks, 59522 NumberOfCodeBlocksAsserted, 488 NumberOfCheckSat, 61359 ConstructedInterpolants, 10604 QuantifiedInterpolants, 203035542 SizeOfPredicates, 173 NumberOfNonLiveVariables, 59732 ConjunctsInSsa, 1305 ConjunctsInUnsatCore, 91 InterpolantComputations, 7 PerfectInterpolantSequences, 3898003/4057391 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-13-40-878.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-13-40-878.csv Completed graceful shutdown