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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 22:53:14,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 22:53:14,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 22:53:14,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 22:53:14,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 22:53:14,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 22:53:14,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 22:53:14,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 22:53:14,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 22:53:14,569 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 22:53:14,570 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 22:53:14,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 22:53:14,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 22:53:14,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 22:53:14,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 22:53:14,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 22:53:14,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 22:53:14,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 22:53:14,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 22:53:14,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 22:53:14,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 22:53:14,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 22:53:14,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 22:53:14,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 22:53:14,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 22:53:14,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 22:53:14,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 22:53:14,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 22:53:14,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 22:53:14,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 22:53:14,585 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 22:53:14,585 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 22:53:14,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 22:53:14,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 22:53:14,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 22:53:14,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 22:53:14,607 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 22:53:14,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 22:53:14,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 22:53:14,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 22:53:14,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 22:53:14,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 22:53:14,647 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 22:53:14,650 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 22:53:14,651 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 22:53:14,652 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 22:53:14,652 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-11 22:53:14,928 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d44f1122 [2018-04-11 22:53:15,023 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 22:53:15,023 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 22:53:15,023 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-11 22:53:15,024 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 22:53:15,024 INFO L215 ultiparseSymbolTable]: [2018-04-11 22:53:15,024 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 22:53:15,024 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-11 22:53:15,024 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-11 22:53:15,024 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 22:53:15,024 INFO L233 ultiparseSymbolTable]: [2018-04-11 22:53:15,037 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d44f1122 [2018-04-11 22:53:15,041 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 22:53:15,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 22:53:15,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 22:53:15,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 22:53:15,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 22:53:15,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38874ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15, skipping insertion in model container [2018-04-11 22:53:15,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,062 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 22:53:15,071 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 22:53:15,166 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 22:53:15,183 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 22:53:15,187 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-11 22:53:15,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15 WrapperNode [2018-04-11 22:53:15,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 22:53:15,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 22:53:15,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 22:53:15,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 22:53:15,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (1/1) ... [2018-04-11 22:53:15,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 22:53:15,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 22:53:15,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 22:53:15,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 22:53:15,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (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-11 22:53:15,255 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 22:53:15,256 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 22:53:15,256 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-11 22:53:15,256 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 22:53:15,256 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-11 22:53:15,256 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 22:53:15,256 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 22:53:15,256 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 22:53:15,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 22:53:15,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 22:53:15,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 22:53:15,257 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 22:53:15,257 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 22:53:15,499 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 22:53:15,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:53:15 BoogieIcfgContainer [2018-04-11 22:53:15,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 22:53:15,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 22:53:15,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 22:53:15,502 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 22:53:15,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:53:15" (1/3) ... [2018-04-11 22:53:15,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3f3756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:53:15, skipping insertion in model container [2018-04-11 22:53:15,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:53:15" (2/3) ... [2018-04-11 22:53:15,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3f3756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:53:15, skipping insertion in model container [2018-04-11 22:53:15,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:53:15" (3/3) ... [2018-04-11 22:53:15,504 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-11 22:53:15,510 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 22:53:15,514 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-11 22:53:15,543 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 22:53:15,544 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 22:53:15,544 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 22:53:15,544 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 22:53:15,545 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 22:53:15,545 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 22:53:15,545 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 22:53:15,545 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 22:53:15,545 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 22:53:15,546 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 22:53:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-11 22:53:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 22:53:15,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:15,560 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:15,560 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-11 22:53:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-04-11 22:53:15,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:15,564 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:15,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:15,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:15,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:15,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:15,672 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-11 22:53:15,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:53:15,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 22:53:15,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 22:53:15,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 22:53:15,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:53:15,691 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-11 22:53:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:15,735 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-11 22:53:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 22:53:15,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 22:53:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:15,742 INFO L225 Difference]: With dead ends: 63 [2018-04-11 22:53:15,742 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 22:53:15,744 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-11 22:53:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 22:53:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-11 22:53:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 22:53:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-11 22:53:15,770 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-11 22:53:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:15,770 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-11 22:53:15,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 22:53:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-11 22:53:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 22:53:15,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:15,771 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:15,771 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-11 22:53:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-04-11 22:53:15,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:15,771 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:15,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:15,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:15,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:15,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:15,820 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-11 22:53:15,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:53:15,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 22:53:15,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 22:53:15,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 22:53:15,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:53:15,822 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-11 22:53:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:15,874 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-11 22:53:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 22:53:15,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-11 22:53:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:15,877 INFO L225 Difference]: With dead ends: 60 [2018-04-11 22:53:15,877 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 22:53:15,878 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-11 22:53:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 22:53:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-11 22:53:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 22:53:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-11 22:53:15,882 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-11 22:53:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:15,884 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-11 22:53:15,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 22:53:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-11 22:53:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 22:53:15,884 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:15,885 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:15,885 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-11 22:53:15,885 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-04-11 22:53:15,885 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:15,885 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:15,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:15,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:15,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:15,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:16,009 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-11 22:53:16,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:53:16,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 22:53:16,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 22:53:16,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 22:53:16,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 22:53:16,010 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-04-11 22:53:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:16,171 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-04-11 22:53:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 22:53:16,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-04-11 22:53:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:16,173 INFO L225 Difference]: With dead ends: 75 [2018-04-11 22:53:16,173 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 22:53:16,173 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-11 22:53:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 22:53:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-04-11 22:53:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 22:53:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-04-11 22:53:16,179 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-04-11 22:53:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:16,179 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-04-11 22:53:16,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 22:53:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-04-11 22:53:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 22:53:16,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:16,180 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:16,180 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-11 22:53:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-04-11 22:53:16,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:16,181 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:16,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:16,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:16,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:16,213 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-11 22:53:16,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:53:16,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 22:53:16,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 22:53:16,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 22:53:16,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:53:16,214 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-04-11 22:53:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:16,239 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-04-11 22:53:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:53:16,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 22:53:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:16,240 INFO L225 Difference]: With dead ends: 65 [2018-04-11 22:53:16,240 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 22:53:16,240 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-11 22:53:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 22:53:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-11 22:53:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 22:53:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-04-11 22:53:16,243 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-04-11 22:53:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:16,243 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-04-11 22:53:16,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 22:53:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-04-11 22:53:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 22:53:16,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:16,244 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-11 22:53:16,244 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-11 22:53:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-04-11 22:53:16,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:16,244 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:16,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:16,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:16,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:16,317 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-11 22:53:16,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:16,318 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:16,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:16,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:16,368 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-11 22:53:16,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:16,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-04-11 22:53:16,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 22:53:16,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 22:53:16,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 22:53:16,390 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-04-11 22:53:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:16,581 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-04-11 22:53:16,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 22:53:16,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-11 22:53:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:16,582 INFO L225 Difference]: With dead ends: 105 [2018-04-11 22:53:16,582 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 22:53:16,583 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-11 22:53:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 22:53:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-04-11 22:53:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 22:53:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-04-11 22:53:16,589 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2018-04-11 22:53:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:16,589 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-04-11 22:53:16,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 22:53:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-04-11 22:53:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 22:53:16,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:16,590 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-11 22:53:16,590 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-11 22:53:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-04-11 22:53:16,590 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:16,590 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:16,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:16,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:16,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:16,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-11 22:53:16,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:53:16,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 22:53:16,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 22:53:16,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 22:53:16,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:53:16,625 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-04-11 22:53:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:16,668 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-11 22:53:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:53:16,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 22:53:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:16,672 INFO L225 Difference]: With dead ends: 85 [2018-04-11 22:53:16,672 INFO L226 Difference]: Without dead ends: 85 [2018-04-11 22:53:16,672 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-11 22:53:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-11 22:53:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-04-11 22:53:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 22:53:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-04-11 22:53:16,677 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 29 [2018-04-11 22:53:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:16,677 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-04-11 22:53:16,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 22:53:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-04-11 22:53:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 22:53:16,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:16,679 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-11 22:53:16,679 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-11 22:53:16,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-04-11 22:53:16,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:16,679 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:16,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:16,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:16,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:16,711 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-11 22:53:16,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:16,711 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:16,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:16,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:53:16,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:16,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-04-11 22:53:16,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 22:53:16,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 22:53:16,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 22:53:16,786 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 8 states. [2018-04-11 22:53:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:16,908 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-04-11 22:53:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 22:53:16,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-04-11 22:53:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:16,910 INFO L225 Difference]: With dead ends: 118 [2018-04-11 22:53:16,910 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 22:53:16,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-11 22:53:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 22:53:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2018-04-11 22:53:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 22:53:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-11 22:53:16,916 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 37 [2018-04-11 22:53:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:16,917 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-11 22:53:16,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 22:53:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-11 22:53:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 22:53:16,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:16,918 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-11 22:53:16,918 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-11 22:53:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-04-11 22:53:16,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:16,918 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:16,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:16,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:16,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:17,119 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-11 22:53:17,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:17,120 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:17,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:17,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:17,221 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-11 22:53:17,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:17,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-04-11 22:53:17,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 22:53:17,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 22:53:17,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-11 22:53:17,240 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 16 states. [2018-04-11 22:53:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:17,666 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-04-11 22:53:17,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 22:53:17,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-04-11 22:53:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:17,667 INFO L225 Difference]: With dead ends: 155 [2018-04-11 22:53:17,667 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 22:53:17,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-04-11 22:53:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 22:53:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-04-11 22:53:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 22:53:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-11 22:53:17,672 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 59 [2018-04-11 22:53:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:17,672 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-11 22:53:17,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 22:53:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-11 22:53:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 22:53:17,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:17,674 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 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] [2018-04-11 22:53:17,674 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-11 22:53:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 2 times [2018-04-11 22:53:17,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:17,674 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:17,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:17,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:17,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:17,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-11 22:53:17,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:17,856 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:17,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:53:17,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-11 22:53:17,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:17,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:17,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:53:17,933 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-11 22:53:17,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:17,936 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-11 22:53:17,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 22:53:17,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:53:17,985 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-11 22:53:17,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:17,987 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-11 22:53:17,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 22:53:18,025 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-11 22:53:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-04-11 22:53:18,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 22:53:18,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2018-04-11 22:53:18,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 22:53:18,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 22:53:18,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-04-11 22:53:18,072 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 14 states. [2018-04-11 22:53:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:18,295 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-04-11 22:53:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 22:53:18,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-04-11 22:53:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:18,296 INFO L225 Difference]: With dead ends: 105 [2018-04-11 22:53:18,296 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 22:53:18,296 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=362, Unknown=1, NotChecked=40, Total=506 [2018-04-11 22:53:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 22:53:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-11 22:53:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 22:53:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-04-11 22:53:18,301 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 67 [2018-04-11 22:53:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:18,301 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-04-11 22:53:18,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 22:53:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-04-11 22:53:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 22:53:18,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:18,303 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-11 22:53:18,304 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-11 22:53:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1376831888, now seen corresponding path program 2 times [2018-04-11 22:53:18,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:18,304 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:18,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:18,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:18,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:18,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:18,393 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-11 22:53:18,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:18,394 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:18,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:53:18,439 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:53:18,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:18,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:18,500 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-11 22:53:18,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:18,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-04-11 22:53:18,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 22:53:18,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 22:53:18,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-11 22:53:18,530 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 11 states. [2018-04-11 22:53:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:18,592 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-04-11 22:53:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 22:53:18,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-04-11 22:53:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:18,593 INFO L225 Difference]: With dead ends: 114 [2018-04-11 22:53:18,593 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 22:53:18,594 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-11 22:53:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 22:53:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2018-04-11 22:53:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 22:53:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2018-04-11 22:53:18,596 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 89 [2018-04-11 22:53:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:18,596 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2018-04-11 22:53:18,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 22:53:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-04-11 22:53:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 22:53:18,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:18,598 INFO L355 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:18,598 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-11 22:53:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -30161384, now seen corresponding path program 3 times [2018-04-11 22:53:18,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:18,598 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:18,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:18,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:18,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:18,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 203 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-04-11 22:53:18,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:18,715 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:53:18,743 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 22:53:18,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:18,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:18,751 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-11 22:53:18,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:18,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:18,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 162 proven. 22 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-04-11 22:53:18,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:18,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-04-11 22:53:18,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 22:53:18,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 22:53:18,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-04-11 22:53:18,979 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 21 states. [2018-04-11 22:53:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:19,339 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-04-11 22:53:19,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 22:53:19,340 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-04-11 22:53:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:19,341 INFO L225 Difference]: With dead ends: 143 [2018-04-11 22:53:19,341 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 22:53:19,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 22:53:19,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 22:53:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-04-11 22:53:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 22:53:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-04-11 22:53:19,346 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 95 [2018-04-11 22:53:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:19,346 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-04-11 22:53:19,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 22:53:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-04-11 22:53:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-04-11 22:53:19,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:19,348 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-11 22:53:19,348 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-11 22:53:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2114920591, now seen corresponding path program 4 times [2018-04-11 22:53:19,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:19,348 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:19,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:19,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:19,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:19,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:19,554 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-11 22:53:19,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:19,554 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:19,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:53:19,596 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:53:19,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:19,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:19,697 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-11 22:53:19,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:19,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-04-11 22:53:19,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 22:53:19,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 22:53:19,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-04-11 22:53:19,724 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 18 states. [2018-04-11 22:53:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:20,024 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2018-04-11 22:53:20,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 22:53:20,024 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-04-11 22:53:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:20,025 INFO L225 Difference]: With dead ends: 161 [2018-04-11 22:53:20,025 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 22:53:20,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 117 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-11 22:53:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 22:53:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-04-11 22:53:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 22:53:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2018-04-11 22:53:20,028 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 125 [2018-04-11 22:53:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:20,028 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2018-04-11 22:53:20,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 22:53:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2018-04-11 22:53:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-11 22:53:20,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:20,029 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-11 22:53:20,030 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-11 22:53:20,030 INFO L82 PathProgramCache]: Analyzing trace with hash -936202175, now seen corresponding path program 5 times [2018-04-11 22:53:20,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:20,030 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:20,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:20,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:20,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:20,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:20,231 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-11 22:53:20,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:20,231 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:20,236 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:53:20,270 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 22:53:20,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:20,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 425 proven. 30 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-11 22:53:20,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:20,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2018-04-11 22:53:20,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 22:53:20,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 22:53:20,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-04-11 22:53:20,454 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 23 states. [2018-04-11 22:53:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:20,935 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2018-04-11 22:53:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 22:53:20,935 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2018-04-11 22:53:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:20,936 INFO L225 Difference]: With dead ends: 211 [2018-04-11 22:53:20,936 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 22:53:20,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1408, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 22:53:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 22:53:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2018-04-11 22:53:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 22:53:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 200 transitions. [2018-04-11 22:53:20,943 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 200 transitions. Word has length 137 [2018-04-11 22:53:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:20,943 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 200 transitions. [2018-04-11 22:53:20,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 22:53:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 200 transitions. [2018-04-11 22:53:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-11 22:53:20,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:20,946 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-11 22:53:20,946 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-11 22:53:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1943695766, now seen corresponding path program 6 times [2018-04-11 22:53:20,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:20,947 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:20,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:20,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:20,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:20,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:21,111 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-11 22:53:21,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:21,111 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:21,120 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:53:21,173 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 22:53:21,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:21,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 716 proven. 333 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-04-11 22:53:21,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:21,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-04-11 22:53:21,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 22:53:21,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 22:53:21,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-04-11 22:53:21,349 INFO L87 Difference]: Start difference. First operand 195 states and 200 transitions. Second operand 28 states. [2018-04-11 22:53:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:21,807 INFO L93 Difference]: Finished difference Result 260 states and 264 transitions. [2018-04-11 22:53:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 22:53:21,807 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 179 [2018-04-11 22:53:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:21,808 INFO L225 Difference]: With dead ends: 260 [2018-04-11 22:53:21,808 INFO L226 Difference]: Without dead ends: 251 [2018-04-11 22:53:21,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 22:53:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-11 22:53:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2018-04-11 22:53:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 22:53:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2018-04-11 22:53:21,814 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 179 [2018-04-11 22:53:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:21,814 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2018-04-11 22:53:21,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 22:53:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2018-04-11 22:53:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-11 22:53:21,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:21,817 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-11 22:53:21,817 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-11 22:53:21,818 INFO L82 PathProgramCache]: Analyzing trace with hash -431804325, now seen corresponding path program 7 times [2018-04-11 22:53:21,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:21,818 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:21,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:21,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:21,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:21,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:21,992 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-11 22:53:21,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:21,993 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:22,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:22,109 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-11 22:53:22,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:22,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-04-11 22:53:22,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 22:53:22,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 22:53:22,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-04-11 22:53:22,128 INFO L87 Difference]: Start difference. First operand 243 states and 247 transitions. Second operand 20 states. [2018-04-11 22:53:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:22,233 INFO L93 Difference]: Finished difference Result 254 states and 256 transitions. [2018-04-11 22:53:22,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 22:53:22,233 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2018-04-11 22:53:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:22,234 INFO L225 Difference]: With dead ends: 254 [2018-04-11 22:53:22,235 INFO L226 Difference]: Without dead ends: 248 [2018-04-11 22:53:22,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-04-11 22:53:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-11 22:53:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 243. [2018-04-11 22:53:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 22:53:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 245 transitions. [2018-04-11 22:53:22,240 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 245 transitions. Word has length 227 [2018-04-11 22:53:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:22,240 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 245 transitions. [2018-04-11 22:53:22,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 22:53:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 245 transitions. [2018-04-11 22:53:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-04-11 22:53:22,242 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:22,242 INFO L355 BasicCegarLoop]: trace histogram [32, 27, 27, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:22,242 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-11 22:53:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 944998563, now seen corresponding path program 8 times [2018-04-11 22:53:22,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:22,242 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:22,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:22,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:22,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:22,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 114 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-04-11 22:53:22,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:22,558 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:22,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:53:22,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:53:22,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:22,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:22,604 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-11 22:53:22,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:22,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:22,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 92 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2018-04-11 22:53:22,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:22,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-04-11 22:53:22,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 22:53:22,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 22:53:22,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-04-11 22:53:22,964 INFO L87 Difference]: Start difference. First operand 243 states and 245 transitions. Second operand 21 states. [2018-04-11 22:53:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:23,429 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2018-04-11 22:53:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 22:53:23,429 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 233 [2018-04-11 22:53:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:23,431 INFO L225 Difference]: With dead ends: 317 [2018-04-11 22:53:23,431 INFO L226 Difference]: Without dead ends: 317 [2018-04-11 22:53:23,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 213 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 22:53:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-11 22:53:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2018-04-11 22:53:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-11 22:53:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 301 transitions. [2018-04-11 22:53:23,440 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 301 transitions. Word has length 233 [2018-04-11 22:53:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:23,441 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 301 transitions. [2018-04-11 22:53:23,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 22:53:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 301 transitions. [2018-04-11 22:53:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-11 22:53:23,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:23,442 INFO L355 BasicCegarLoop]: trace histogram [40, 34, 34, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:23,442 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-11 22:53:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash 733219996, now seen corresponding path program 9 times [2018-04-11 22:53:23,442 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:23,442 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:23,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:23,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:23,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:23,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2257 proven. 102 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2018-04-11 22:53:23,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:23,710 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:23,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:53:23,787 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-11 22:53:23,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:23,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2051 proven. 382 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-11 22:53:24,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:24,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2018-04-11 22:53:24,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 22:53:24,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 22:53:24,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 22:53:24,040 INFO L87 Difference]: Start difference. First operand 297 states and 301 transitions. Second operand 34 states. [2018-04-11 22:53:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:24,708 INFO L93 Difference]: Finished difference Result 316 states and 318 transitions. [2018-04-11 22:53:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 22:53:24,709 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 287 [2018-04-11 22:53:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:24,710 INFO L225 Difference]: With dead ends: 316 [2018-04-11 22:53:24,710 INFO L226 Difference]: Without dead ends: 310 [2018-04-11 22:53:24,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=3006, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 22:53:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-11 22:53:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 303. [2018-04-11 22:53:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-11 22:53:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 305 transitions. [2018-04-11 22:53:24,715 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 305 transitions. Word has length 287 [2018-04-11 22:53:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:24,716 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 305 transitions. [2018-04-11 22:53:24,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 22:53:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 305 transitions. [2018-04-11 22:53:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-04-11 22:53:24,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:24,717 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-11 22:53:24,718 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-11 22:53:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 10 times [2018-04-11 22:53:24,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:24,718 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:24,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:24,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:24,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:24,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:25,170 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-11 22:53:25,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:25,170 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:25,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:53:25,237 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:53:25,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:25,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:25,243 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-11 22:53:25,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:25,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:25,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1260 proven. 663 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2018-04-11 22:53:25,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:25,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 23 [2018-04-11 22:53:25,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 22:53:25,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 22:53:25,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2018-04-11 22:53:25,676 INFO L87 Difference]: Start difference. First operand 303 states and 305 transitions. Second operand 24 states. [2018-04-11 22:53:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:25,999 INFO L93 Difference]: Finished difference Result 317 states and 320 transitions. [2018-04-11 22:53:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 22:53:25,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 293 [2018-04-11 22:53:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:26,001 INFO L225 Difference]: With dead ends: 317 [2018-04-11 22:53:26,001 INFO L226 Difference]: Without dead ends: 317 [2018-04-11 22:53:26,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 270 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2018-04-11 22:53:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-11 22:53:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 309. [2018-04-11 22:53:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-04-11 22:53:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2018-04-11 22:53:26,007 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 293 [2018-04-11 22:53:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:26,007 INFO L459 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2018-04-11 22:53:26,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 22:53:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2018-04-11 22:53:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-04-11 22:53:26,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:26,009 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-11 22:53:26,009 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-11 22:53:26,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 11 times [2018-04-11 22:53:26,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:26,009 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:26,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:26,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:26,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:26,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:26,504 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-11 22:53:26,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:26,504 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:26,509 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:53:26,616 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-04-11 22:53:26,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:26,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1624 proven. 613 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-04-11 22:53:26,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:26,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 34 [2018-04-11 22:53:26,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 22:53:26,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 22:53:26,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 22:53:26,855 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 34 states. [2018-04-11 22:53:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:27,465 INFO L93 Difference]: Finished difference Result 368 states and 371 transitions. [2018-04-11 22:53:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 22:53:27,466 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 299 [2018-04-11 22:53:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:27,467 INFO L225 Difference]: With dead ends: 368 [2018-04-11 22:53:27,467 INFO L226 Difference]: Without dead ends: 368 [2018-04-11 22:53:27,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 22:53:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-11 22:53:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 363. [2018-04-11 22:53:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-11 22:53:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 366 transitions. [2018-04-11 22:53:27,475 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 366 transitions. Word has length 299 [2018-04-11 22:53:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:27,475 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 366 transitions. [2018-04-11 22:53:27,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 22:53:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 366 transitions. [2018-04-11 22:53:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-04-11 22:53:27,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:27,477 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-11 22:53:27,477 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-11 22:53:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1483763557, now seen corresponding path program 12 times [2018-04-11 22:53:27,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:27,478 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:27,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:27,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:27,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:27,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:27,868 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-11 22:53:27,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:27,868 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:27,874 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:53:27,964 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-11 22:53:27,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:27,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:27,974 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-11 22:53:27,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:27,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:27,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:28,648 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-11 22:53:28,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:28,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-04-11 22:53:28,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 22:53:28,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 22:53:28,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-04-11 22:53:28,679 INFO L87 Difference]: Start difference. First operand 363 states and 366 transitions. Second operand 32 states. [2018-04-11 22:53:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:30,345 INFO L93 Difference]: Finished difference Result 440 states and 442 transitions. [2018-04-11 22:53:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 22:53:30,345 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 353 [2018-04-11 22:53:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:30,346 INFO L225 Difference]: With dead ends: 440 [2018-04-11 22:53:30,346 INFO L226 Difference]: Without dead ends: 431 [2018-04-11 22:53:30,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 336 SyntacticMatches, 13 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1497, Invalid=6875, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 22:53:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-11 22:53:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2018-04-11 22:53:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-11 22:53:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 425 transitions. [2018-04-11 22:53:30,355 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 425 transitions. Word has length 353 [2018-04-11 22:53:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:30,355 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 425 transitions. [2018-04-11 22:53:30,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 22:53:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 425 transitions. [2018-04-11 22:53:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-04-11 22:53:30,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:30,358 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-11 22:53:30,358 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-11 22:53:30,358 INFO L82 PathProgramCache]: Analyzing trace with hash -983766034, now seen corresponding path program 13 times [2018-04-11 22:53:30,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:30,358 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:30,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:30,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:30,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:30,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:30,797 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-11 22:53:30,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:30,798 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:30,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:30,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:31,027 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-11 22:53:31,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:31,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-04-11 22:53:31,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 22:53:31,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 22:53:31,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-04-11 22:53:31,047 INFO L87 Difference]: Start difference. First operand 423 states and 425 transitions. Second operand 29 states. [2018-04-11 22:53:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:31,380 INFO L93 Difference]: Finished difference Result 448 states and 450 transitions. [2018-04-11 22:53:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 22:53:31,380 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 419 [2018-04-11 22:53:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:31,381 INFO L225 Difference]: With dead ends: 448 [2018-04-11 22:53:31,381 INFO L226 Difference]: Without dead ends: 442 [2018-04-11 22:53:31,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 22:53:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-11 22:53:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 433. [2018-04-11 22:53:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 22:53:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 435 transitions. [2018-04-11 22:53:31,386 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 435 transitions. Word has length 419 [2018-04-11 22:53:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:31,387 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 435 transitions. [2018-04-11 22:53:31,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 22:53:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 435 transitions. [2018-04-11 22:53:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-04-11 22:53:31,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:31,388 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-11 22:53:31,388 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-11 22:53:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1494870518, now seen corresponding path program 14 times [2018-04-11 22:53:31,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:31,388 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:31,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:31,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:31,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:31,902 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-11 22:53:31,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:31,902 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:31,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:53:31,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:53:31,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:31,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:31,996 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-11 22:53:31,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:31,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:31,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:32,414 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-11 22:53:32,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:32,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2018-04-11 22:53:32,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 22:53:32,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 22:53:32,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-04-11 22:53:32,434 INFO L87 Difference]: Start difference. First operand 433 states and 435 transitions. Second operand 16 states. [2018-04-11 22:53:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:32,713 INFO L93 Difference]: Finished difference Result 441 states and 443 transitions. [2018-04-11 22:53:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 22:53:32,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 425 [2018-04-11 22:53:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:32,717 INFO L225 Difference]: With dead ends: 441 [2018-04-11 22:53:32,717 INFO L226 Difference]: Without dead ends: 441 [2018-04-11 22:53:32,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 406 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2018-04-11 22:53:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-04-11 22:53:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 435. [2018-04-11 22:53:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 22:53:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 437 transitions. [2018-04-11 22:53:32,724 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 437 transitions. Word has length 425 [2018-04-11 22:53:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:32,725 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 437 transitions. [2018-04-11 22:53:32,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 22:53:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 437 transitions. [2018-04-11 22:53:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-04-11 22:53:32,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:32,728 INFO L355 BasicCegarLoop]: trace histogram [62, 54, 54, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:32,728 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-11 22:53:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2009639230, now seen corresponding path program 15 times [2018-04-11 22:53:32,728 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:32,728 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:32,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:32,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:32,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:32,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 2720 proven. 252 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-04-11 22:53:33,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:33,382 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:33,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:53:33,523 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 22:53:33,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:33,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:33,529 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-11 22:53:33,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:33,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:33,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 2720 proven. 252 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-04-11 22:53:33,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:33,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 16 [2018-04-11 22:53:33,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 22:53:33,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 22:53:33,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-04-11 22:53:33,872 INFO L87 Difference]: Start difference. First operand 435 states and 437 transitions. Second operand 17 states. [2018-04-11 22:53:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:34,098 INFO L93 Difference]: Finished difference Result 459 states and 463 transitions. [2018-04-11 22:53:34,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 22:53:34,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 431 [2018-04-11 22:53:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:34,100 INFO L225 Difference]: With dead ends: 459 [2018-04-11 22:53:34,100 INFO L226 Difference]: Without dead ends: 459 [2018-04-11 22:53:34,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 412 SyntacticMatches, 18 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2018-04-11 22:53:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-04-11 22:53:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 441. [2018-04-11 22:53:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-11 22:53:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 444 transitions. [2018-04-11 22:53:34,104 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 444 transitions. Word has length 431 [2018-04-11 22:53:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:34,104 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 444 transitions. [2018-04-11 22:53:34,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 22:53:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 444 transitions. [2018-04-11 22:53:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-11 22:53:34,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:34,106 INFO L355 BasicCegarLoop]: trace histogram [63, 55, 55, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:34,106 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-11 22:53:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 49074822, now seen corresponding path program 16 times [2018-04-11 22:53:34,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:34,106 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:34,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:34,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:34,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:34,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3281 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-11 22:53:34,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:34,572 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:53:34,639 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:53:34,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:34,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3310 proven. 200 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-11 22:53:34,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:34,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 36 [2018-04-11 22:53:34,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 22:53:34,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 22:53:34,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 22:53:34,922 INFO L87 Difference]: Start difference. First operand 441 states and 444 transitions. Second operand 36 states. [2018-04-11 22:53:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:35,476 INFO L93 Difference]: Finished difference Result 527 states and 531 transitions. [2018-04-11 22:53:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 22:53:35,476 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 437 [2018-04-11 22:53:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:35,478 INFO L225 Difference]: With dead ends: 527 [2018-04-11 22:53:35,478 INFO L226 Difference]: Without dead ends: 527 [2018-04-11 22:53:35,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=792, Invalid=2178, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 22:53:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-04-11 22:53:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 519. [2018-04-11 22:53:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-04-11 22:53:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 523 transitions. [2018-04-11 22:53:35,482 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 523 transitions. Word has length 437 [2018-04-11 22:53:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:35,483 INFO L459 AbstractCegarLoop]: Abstraction has 519 states and 523 transitions. [2018-04-11 22:53:35,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 22:53:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 523 transitions. [2018-04-11 22:53:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-04-11 22:53:35,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:35,485 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-11 22:53:35,485 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-11 22:53:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 17 times [2018-04-11 22:53:35,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:35,485 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:35,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:35,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:35,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:35,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:36,145 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-11 22:53:36,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:36,146 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:36,151 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:53:36,294 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-11 22:53:36,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:36,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 6365 proven. 1285 refuted. 0 times theorem prover too weak. 5949 trivial. 0 not checked. [2018-04-11 22:53:36,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:36,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 40 [2018-04-11 22:53:36,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 22:53:36,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 22:53:36,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 22:53:36,731 INFO L87 Difference]: Start difference. First operand 519 states and 523 transitions. Second operand 40 states. [2018-04-11 22:53:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:37,946 INFO L93 Difference]: Finished difference Result 539 states and 542 transitions. [2018-04-11 22:53:37,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 22:53:37,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 503 [2018-04-11 22:53:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:37,948 INFO L225 Difference]: With dead ends: 539 [2018-04-11 22:53:37,948 INFO L226 Difference]: Without dead ends: 533 [2018-04-11 22:53:37,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=898, Invalid=4214, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 22:53:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-11 22:53:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 525. [2018-04-11 22:53:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-11 22:53:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 528 transitions. [2018-04-11 22:53:37,956 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 528 transitions. Word has length 503 [2018-04-11 22:53:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:37,957 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 528 transitions. [2018-04-11 22:53:37,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 22:53:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 528 transitions. [2018-04-11 22:53:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-04-11 22:53:37,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:37,960 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-11 22:53:37,960 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-11 22:53:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash 874224735, now seen corresponding path program 18 times [2018-04-11 22:53:37,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:37,960 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:37,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:37,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:37,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:37,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:38,825 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-11 22:53:38,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:38,826 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:38,831 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:53:39,020 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-11 22:53:39,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:39,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:39,051 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-11 22:53:39,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:39,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:39,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4005 proven. 274 refuted. 0 times theorem prover too weak. 10126 trivial. 0 not checked. [2018-04-11 22:53:40,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:40,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-04-11 22:53:40,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 22:53:40,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 22:53:40,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2018-04-11 22:53:40,356 INFO L87 Difference]: Start difference. First operand 525 states and 528 transitions. Second operand 31 states. [2018-04-11 22:53:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:41,187 INFO L93 Difference]: Finished difference Result 627 states and 633 transitions. [2018-04-11 22:53:41,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 22:53:41,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 515 [2018-04-11 22:53:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:41,189 INFO L225 Difference]: With dead ends: 627 [2018-04-11 22:53:41,189 INFO L226 Difference]: Without dead ends: 627 [2018-04-11 22:53:41,190 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 482 SyntacticMatches, 20 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=790, Invalid=2402, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 22:53:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-04-11 22:53:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 603. [2018-04-11 22:53:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-04-11 22:53:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 608 transitions. [2018-04-11 22:53:41,194 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 608 transitions. Word has length 515 [2018-04-11 22:53:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:41,194 INFO L459 AbstractCegarLoop]: Abstraction has 603 states and 608 transitions. [2018-04-11 22:53:41,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 22:53:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 608 transitions. [2018-04-11 22:53:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-04-11 22:53:41,196 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:41,197 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-11 22:53:41,197 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-11 22:53:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1350141368, now seen corresponding path program 19 times [2018-04-11 22:53:41,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:41,197 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:41,197 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:41,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:41,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:41,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:41,861 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-11 22:53:41,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:41,862 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:41,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:41,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:42,530 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-11 22:53:42,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:42,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-04-11 22:53:42,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 22:53:42,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 22:53:42,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 22:53:42,550 INFO L87 Difference]: Start difference. First operand 603 states and 608 transitions. Second operand 35 states. [2018-04-11 22:53:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:42,810 INFO L93 Difference]: Finished difference Result 622 states and 626 transitions. [2018-04-11 22:53:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 22:53:42,811 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 593 [2018-04-11 22:53:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:42,812 INFO L225 Difference]: With dead ends: 622 [2018-04-11 22:53:42,812 INFO L226 Difference]: Without dead ends: 616 [2018-04-11 22:53:42,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 22:53:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-11 22:53:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 609. [2018-04-11 22:53:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-04-11 22:53:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 613 transitions. [2018-04-11 22:53:42,817 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 613 transitions. Word has length 593 [2018-04-11 22:53:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:42,818 INFO L459 AbstractCegarLoop]: Abstraction has 609 states and 613 transitions. [2018-04-11 22:53:42,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 22:53:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 613 transitions. [2018-04-11 22:53:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-04-11 22:53:42,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:42,820 INFO L355 BasicCegarLoop]: trace histogram [88, 78, 78, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:42,820 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-11 22:53:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash -46382016, now seen corresponding path program 20 times [2018-04-11 22:53:42,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:42,821 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:42,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:42,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:53:42,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:42,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20014 backedges. 5619 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-11 22:53:43,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:43,622 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:43,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:53:43,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:53:43,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:43,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20014 backedges. 5584 proven. 380 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-11 22:53:44,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:44,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 56 [2018-04-11 22:53:44,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 22:53:44,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 22:53:44,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=2548, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 22:53:44,316 INFO L87 Difference]: Start difference. First operand 609 states and 613 transitions. Second operand 56 states. [2018-04-11 22:53:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:45,135 INFO L93 Difference]: Finished difference Result 710 states and 715 transitions. [2018-04-11 22:53:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 22:53:45,135 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 599 [2018-04-11 22:53:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:45,136 INFO L225 Difference]: With dead ends: 710 [2018-04-11 22:53:45,136 INFO L226 Difference]: Without dead ends: 710 [2018-04-11 22:53:45,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1310, Invalid=5170, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 22:53:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-04-11 22:53:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 699. [2018-04-11 22:53:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-04-11 22:53:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 704 transitions. [2018-04-11 22:53:45,144 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 704 transitions. Word has length 599 [2018-04-11 22:53:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:45,144 INFO L459 AbstractCegarLoop]: Abstraction has 699 states and 704 transitions. [2018-04-11 22:53:45,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 22:53:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 704 transitions. [2018-04-11 22:53:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-04-11 22:53:45,147 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:45,147 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-11 22:53:45,147 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-11 22:53:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1742682151, now seen corresponding path program 21 times [2018-04-11 22:53:45,148 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:45,148 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:45,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:45,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:45,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:45,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:46,052 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-11 22:53:46,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:46,052 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:46,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:53:46,200 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-04-11 22:53:46,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:46,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 10431 proven. 1192 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-11 22:53:46,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:46,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2018-04-11 22:53:46,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 22:53:46,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 22:53:46,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=2836, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 22:53:46,745 INFO L87 Difference]: Start difference. First operand 699 states and 704 transitions. Second operand 58 states. [2018-04-11 22:53:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:48,845 INFO L93 Difference]: Finished difference Result 799 states and 803 transitions. [2018-04-11 22:53:48,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 22:53:48,845 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 677 [2018-04-11 22:53:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:48,847 INFO L225 Difference]: With dead ends: 799 [2018-04-11 22:53:48,848 INFO L226 Difference]: Without dead ends: 793 [2018-04-11 22:53:48,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3673 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1946, Invalid=10264, Unknown=0, NotChecked=0, Total=12210 [2018-04-11 22:53:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-04-11 22:53:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 699. [2018-04-11 22:53:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-04-11 22:53:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 702 transitions. [2018-04-11 22:53:48,857 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 702 transitions. Word has length 677 [2018-04-11 22:53:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:48,858 INFO L459 AbstractCegarLoop]: Abstraction has 699 states and 702 transitions. [2018-04-11 22:53:48,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 22:53:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 702 transitions. [2018-04-11 22:53:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-04-11 22:53:48,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:48,863 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-11 22:53:48,863 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-11 22:53:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash -661149279, now seen corresponding path program 22 times [2018-04-11 22:53:48,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:48,863 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:48,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:48,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:48,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:48,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:49,873 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-11 22:53:49,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:49,873 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:53:50,007 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:53:50,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:50,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:50,017 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-11 22:53:50,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:50,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:50,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 26547 backedges. 6015 proven. 1768 refuted. 0 times theorem prover too weak. 18764 trivial. 0 not checked. [2018-04-11 22:53:50,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:50,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 33 [2018-04-11 22:53:50,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 22:53:50,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 22:53:50,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 22:53:50,868 INFO L87 Difference]: Start difference. First operand 699 states and 702 transitions. Second operand 34 states. [2018-04-11 22:53:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:51,396 INFO L93 Difference]: Finished difference Result 716 states and 720 transitions. [2018-04-11 22:53:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 22:53:51,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 683 [2018-04-11 22:53:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:51,398 INFO L225 Difference]: With dead ends: 716 [2018-04-11 22:53:51,398 INFO L226 Difference]: Without dead ends: 716 [2018-04-11 22:53:51,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 645 SyntacticMatches, 23 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=450, Invalid=1712, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 22:53:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-04-11 22:53:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 705. [2018-04-11 22:53:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-04-11 22:53:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 709 transitions. [2018-04-11 22:53:51,405 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 709 transitions. Word has length 683 [2018-04-11 22:53:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:51,405 INFO L459 AbstractCegarLoop]: Abstraction has 705 states and 709 transitions. [2018-04-11 22:53:51,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 22:53:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 709 transitions. [2018-04-11 22:53:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-04-11 22:53:51,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:51,410 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-11 22:53:51,410 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-11 22:53:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1048265559, now seen corresponding path program 23 times [2018-04-11 22:53:51,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:51,411 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:51,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:51,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:51,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:51,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:52,318 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-11 22:53:52,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:52,318 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:52,323 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:53:52,589 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-04-11 22:53:52,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:52,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 7153 proven. 374 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-11 22:53:53,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:53,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 45 [2018-04-11 22:53:53,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 22:53:53,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 22:53:53,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1514, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 22:53:53,038 INFO L87 Difference]: Start difference. First operand 705 states and 709 transitions. Second operand 45 states. [2018-04-11 22:53:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:53,713 INFO L93 Difference]: Finished difference Result 806 states and 811 transitions. [2018-04-11 22:53:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 22:53:53,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 689 [2018-04-11 22:53:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:53,715 INFO L225 Difference]: With dead ends: 806 [2018-04-11 22:53:53,715 INFO L226 Difference]: Without dead ends: 806 [2018-04-11 22:53:53,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1263, Invalid=3567, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 22:53:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-04-11 22:53:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 795. [2018-04-11 22:53:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-04-11 22:53:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 800 transitions. [2018-04-11 22:53:53,721 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 800 transitions. Word has length 689 [2018-04-11 22:53:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:53,722 INFO L459 AbstractCegarLoop]: Abstraction has 795 states and 800 transitions. [2018-04-11 22:53:53,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 22:53:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 800 transitions. [2018-04-11 22:53:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-04-11 22:53:53,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:53,728 INFO L355 BasicCegarLoop]: trace histogram [115, 103, 103, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:53:53,728 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-11 22:53:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1462874826, now seen corresponding path program 24 times [2018-04-11 22:53:53,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:53,729 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:53,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:53,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:53,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:53,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:53:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 17188 proven. 2197 refuted. 0 times theorem prover too weak. 15253 trivial. 0 not checked. [2018-04-11 22:53:54,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:53:54,971 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:53:54,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:53:55,243 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-11 22:53:55,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:53:55,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:53:55,252 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-11 22:53:55,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:53:55,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:53:55,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:53:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 7646 proven. 470 refuted. 0 times theorem prover too weak. 26522 trivial. 0 not checked. [2018-04-11 22:53:56,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:53:56,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20] total 51 [2018-04-11 22:53:56,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 22:53:56,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 22:53:56,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2205, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 22:53:56,891 INFO L87 Difference]: Start difference. First operand 795 states and 800 transitions. Second operand 51 states. [2018-04-11 22:53:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:53:59,366 INFO L93 Difference]: Finished difference Result 914 states and 919 transitions. [2018-04-11 22:53:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-11 22:53:59,366 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 773 [2018-04-11 22:53:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:53:59,368 INFO L225 Difference]: With dead ends: 914 [2018-04-11 22:53:59,368 INFO L226 Difference]: Without dead ends: 905 [2018-04-11 22:53:59,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 733 SyntacticMatches, 23 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4692 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1823, Invalid=11287, Unknown=0, NotChecked=0, Total=13110 [2018-04-11 22:53:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-04-11 22:53:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 885. [2018-04-11 22:53:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-04-11 22:53:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 889 transitions. [2018-04-11 22:53:59,378 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 889 transitions. Word has length 773 [2018-04-11 22:53:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:53:59,379 INFO L459 AbstractCegarLoop]: Abstraction has 885 states and 889 transitions. [2018-04-11 22:53:59,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 22:53:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 889 transitions. [2018-04-11 22:53:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2018-04-11 22:53:59,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:53:59,385 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-11 22:53:59,385 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-11 22:53:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash 593559995, now seen corresponding path program 25 times [2018-04-11 22:53:59,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:53:59,386 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:53:59,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:59,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:53:59,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:53:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:53:59,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 19928 proven. 3250 refuted. 0 times theorem prover too weak. 21349 trivial. 0 not checked. [2018-04-11 22:54:00,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:00,878 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:54:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:01,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 16915 proven. 494 refuted. 0 times theorem prover too weak. 27118 trivial. 0 not checked. [2018-04-11 22:54:01,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:01,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 57 [2018-04-11 22:54:01,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 22:54:01,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 22:54:01,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2648, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 22:54:01,574 INFO L87 Difference]: Start difference. First operand 885 states and 889 transitions. Second operand 57 states. [2018-04-11 22:54:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:03,292 INFO L93 Difference]: Finished difference Result 916 states and 920 transitions. [2018-04-11 22:54:03,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 22:54:03,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 869 [2018-04-11 22:54:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:03,294 INFO L225 Difference]: With dead ends: 916 [2018-04-11 22:54:03,295 INFO L226 Difference]: Without dead ends: 910 [2018-04-11 22:54:03,296 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2757 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1566, Invalid=7364, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 22:54:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-04-11 22:54:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 895. [2018-04-11 22:54:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-04-11 22:54:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 899 transitions. [2018-04-11 22:54:03,305 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 899 transitions. Word has length 869 [2018-04-11 22:54:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:03,306 INFO L459 AbstractCegarLoop]: Abstraction has 895 states and 899 transitions. [2018-04-11 22:54:03,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 22:54:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 899 transitions. [2018-04-11 22:54:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-04-11 22:54:03,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:03,312 INFO L355 BasicCegarLoop]: trace histogram [131, 118, 118, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:54:03,312 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-11 22:54:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash -753671677, now seen corresponding path program 26 times [2018-04-11 22:54:03,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:03,313 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:03,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:03,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:54:03,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:03,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 8905 proven. 520 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-11 22:54:04,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:04,794 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:04,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:54:05,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:54:05,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:05,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:05,054 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-11 22:54:05,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:54:05,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:54:05,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:54:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 8905 proven. 520 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-11 22:54:06,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:06,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2018-04-11 22:54:06,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 22:54:06,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 22:54:06,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=256, Unknown=0, NotChecked=0, Total=420 [2018-04-11 22:54:06,005 INFO L87 Difference]: Start difference. First operand 895 states and 899 transitions. Second operand 21 states. [2018-04-11 22:54:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:06,319 INFO L93 Difference]: Finished difference Result 909 states and 913 transitions. [2018-04-11 22:54:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 22:54:06,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 875 [2018-04-11 22:54:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:06,321 INFO L225 Difference]: With dead ends: 909 [2018-04-11 22:54:06,321 INFO L226 Difference]: Without dead ends: 909 [2018-04-11 22:54:06,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 846 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=431, Invalid=759, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 22:54:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-04-11 22:54:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 897. [2018-04-11 22:54:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-04-11 22:54:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 901 transitions. [2018-04-11 22:54:06,326 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 901 transitions. Word has length 875 [2018-04-11 22:54:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:06,327 INFO L459 AbstractCegarLoop]: Abstraction has 897 states and 901 transitions. [2018-04-11 22:54:06,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 22:54:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 901 transitions. [2018-04-11 22:54:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2018-04-11 22:54:06,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:06,330 INFO L355 BasicCegarLoop]: trace histogram [132, 119, 119, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:54:06,331 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-11 22:54:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1944476789, now seen corresponding path program 27 times [2018-04-11 22:54:06,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:06,331 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:06,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:06,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:06,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:06,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-11 22:54:07,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:07,810 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:07,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:54:08,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-04-11 22:54:08,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:08,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:08,052 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-11 22:54:08,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:54:08,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:54:08,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:54:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-11 22:54:09,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:09,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-04-11 22:54:09,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 22:54:09,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 22:54:09,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=280, Unknown=0, NotChecked=0, Total=462 [2018-04-11 22:54:09,114 INFO L87 Difference]: Start difference. First operand 897 states and 901 transitions. Second operand 22 states. [2018-04-11 22:54:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:09,442 INFO L93 Difference]: Finished difference Result 927 states and 933 transitions. [2018-04-11 22:54:09,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 22:54:09,442 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 881 [2018-04-11 22:54:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:09,444 INFO L225 Difference]: With dead ends: 927 [2018-04-11 22:54:09,444 INFO L226 Difference]: Without dead ends: 927 [2018-04-11 22:54:09,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 852 SyntacticMatches, 28 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=849, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 22:54:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-04-11 22:54:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 903. [2018-04-11 22:54:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-04-11 22:54:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 908 transitions. [2018-04-11 22:54:09,450 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 908 transitions. Word has length 881 [2018-04-11 22:54:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:09,450 INFO L459 AbstractCegarLoop]: Abstraction has 903 states and 908 transitions. [2018-04-11 22:54:09,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 22:54:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 908 transitions. [2018-04-11 22:54:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2018-04-11 22:54:09,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:09,454 INFO L355 BasicCegarLoop]: trace histogram [133, 120, 120, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:54:09,454 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-11 22:54:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1515855635, now seen corresponding path program 28 times [2018-04-11 22:54:09,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:09,455 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:09,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:09,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:09,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:09,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 10851 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-11 22:54:10,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:10,865 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:10,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:54:10,975 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:54:10,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:10,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 10895 proven. 520 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-11 22:54:11,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:11,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 51 [2018-04-11 22:54:11,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 22:54:11,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 22:54:11,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=1954, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 22:54:11,502 INFO L87 Difference]: Start difference. First operand 903 states and 908 transitions. Second operand 51 states. [2018-04-11 22:54:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:12,370 INFO L93 Difference]: Finished difference Result 1025 states and 1031 transitions. [2018-04-11 22:54:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 22:54:12,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 887 [2018-04-11 22:54:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:12,372 INFO L225 Difference]: With dead ends: 1025 [2018-04-11 22:54:12,373 INFO L226 Difference]: Without dead ends: 1025 [2018-04-11 22:54:12,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1637, Invalid=4683, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 22:54:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-04-11 22:54:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1011. [2018-04-11 22:54:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-04-11 22:54:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1017 transitions. [2018-04-11 22:54:12,380 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1017 transitions. Word has length 887 [2018-04-11 22:54:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:12,381 INFO L459 AbstractCegarLoop]: Abstraction has 1011 states and 1017 transitions. [2018-04-11 22:54:12,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 22:54:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1017 transitions. [2018-04-11 22:54:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2018-04-11 22:54:12,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:12,387 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-11 22:54:12,387 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-11 22:54:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash 951248836, now seen corresponding path program 29 times [2018-04-11 22:54:12,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:12,388 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:12,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:12,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:12,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:12,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 24474 proven. 4377 refuted. 0 times theorem prover too weak. 29263 trivial. 0 not checked. [2018-04-11 22:54:14,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:14,153 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:14,158 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:54:14,659 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-11 22:54:14,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:14,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 21295 proven. 2980 refuted. 0 times theorem prover too weak. 33839 trivial. 0 not checked. [2018-04-11 22:54:15,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:15,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 63 [2018-04-11 22:54:15,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-11 22:54:15,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-11 22:54:15,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=3293, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 22:54:15,357 INFO L87 Difference]: Start difference. First operand 1011 states and 1017 transitions. Second operand 63 states. [2018-04-11 22:54:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:16,750 INFO L93 Difference]: Finished difference Result 1028 states and 1032 transitions. [2018-04-11 22:54:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 22:54:16,750 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 983 [2018-04-11 22:54:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:16,752 INFO L225 Difference]: With dead ends: 1028 [2018-04-11 22:54:16,752 INFO L226 Difference]: Without dead ends: 1022 [2018-04-11 22:54:16,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3379 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2021, Invalid=9109, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 22:54:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-04-11 22:54:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1011. [2018-04-11 22:54:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-04-11 22:54:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1015 transitions. [2018-04-11 22:54:16,759 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1015 transitions. Word has length 983 [2018-04-11 22:54:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:16,759 INFO L459 AbstractCegarLoop]: Abstraction has 1011 states and 1015 transitions. [2018-04-11 22:54:16,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-11 22:54:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1015 transitions. [2018-04-11 22:54:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-04-11 22:54:16,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:16,764 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-11 22:54:16,764 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-11 22:54:16,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1557282124, now seen corresponding path program 30 times [2018-04-11 22:54:16,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:16,765 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:16,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:16,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:16,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:16,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:18,445 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-11 22:54:18,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:18,445 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:18,450 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:54:18,862 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-04-11 22:54:18,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:18,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:18,878 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-11 22:54:18,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:54:18,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:54:18,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:54:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 11648 proven. 632 refuted. 0 times theorem prover too weak. 46664 trivial. 0 not checked. [2018-04-11 22:54:20,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:20,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2018-04-11 22:54:20,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 22:54:20,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 22:54:20,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1128, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 22:54:20,549 INFO L87 Difference]: Start difference. First operand 1011 states and 1015 transitions. Second operand 39 states. [2018-04-11 22:54:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:21,694 INFO L93 Difference]: Finished difference Result 1145 states and 1152 transitions. [2018-04-11 22:54:21,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 22:54:21,694 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 989 [2018-04-11 22:54:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:21,696 INFO L225 Difference]: With dead ends: 1145 [2018-04-11 22:54:21,696 INFO L226 Difference]: Without dead ends: 1145 [2018-04-11 22:54:21,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 942 SyntacticMatches, 30 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1264, Invalid=4138, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 22:54:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-04-11 22:54:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1119. [2018-04-11 22:54:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-04-11 22:54:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1125 transitions. [2018-04-11 22:54:21,702 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1125 transitions. Word has length 989 [2018-04-11 22:54:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:21,702 INFO L459 AbstractCegarLoop]: Abstraction has 1119 states and 1125 transitions. [2018-04-11 22:54:21,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 22:54:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1125 transitions. [2018-04-11 22:54:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1098 [2018-04-11 22:54:21,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:21,708 INFO L355 BasicCegarLoop]: trace histogram [166, 151, 151, 150, 150, 150, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:54:21,708 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-11 22:54:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 890947789, now seen corresponding path program 31 times [2018-04-11 22:54:21,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:21,708 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:21,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:21,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:21,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:21,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 73515 backedges. 28930 proven. 5578 refuted. 0 times theorem prover too weak. 39007 trivial. 0 not checked. [2018-04-11 22:54:23,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:23,992 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:54:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:24,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 73515 backedges. 26053 proven. 660 refuted. 0 times theorem prover too weak. 46802 trivial. 0 not checked. [2018-04-11 22:54:24,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:24,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 63 [2018-04-11 22:54:24,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-11 22:54:24,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-11 22:54:24,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=3232, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 22:54:24,848 INFO L87 Difference]: Start difference. First operand 1119 states and 1125 transitions. Second operand 63 states. [2018-04-11 22:54:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:26,225 INFO L93 Difference]: Finished difference Result 1146 states and 1151 transitions. [2018-04-11 22:54:26,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 22:54:26,226 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1097 [2018-04-11 22:54:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:26,228 INFO L225 Difference]: With dead ends: 1146 [2018-04-11 22:54:26,228 INFO L226 Difference]: Without dead ends: 1140 [2018-04-11 22:54:26,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1177 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1947, Invalid=8973, Unknown=0, NotChecked=0, Total=10920 [2018-04-11 22:54:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-04-11 22:54:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1125. [2018-04-11 22:54:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2018-04-11 22:54:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1130 transitions. [2018-04-11 22:54:26,234 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1130 transitions. Word has length 1097 [2018-04-11 22:54:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:26,234 INFO L459 AbstractCegarLoop]: Abstraction has 1125 states and 1130 transitions. [2018-04-11 22:54:26,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-11 22:54:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1130 transitions. [2018-04-11 22:54:26,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-04-11 22:54:26,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:26,240 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-11 22:54:26,240 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-11 22:54:26,240 INFO L82 PathProgramCache]: Analyzing trace with hash -80485483, now seen corresponding path program 32 times [2018-04-11 22:54:26,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:26,240 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:26,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:26,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:54:26,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:26,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 14025 proven. 784 refuted. 0 times theorem prover too weak. 59640 trivial. 0 not checked. [2018-04-11 22:54:28,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:28,332 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:28,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:54:28,510 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:54:28,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:28,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:28,522 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-11 22:54:28,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:54:28,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:54:28,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:54:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 14025 proven. 722 refuted. 0 times theorem prover too weak. 59702 trivial. 0 not checked. [2018-04-11 22:54:30,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:30,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2018-04-11 22:54:30,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 22:54:30,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 22:54:30,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 22:54:30,423 INFO L87 Difference]: Start difference. First operand 1125 states and 1130 transitions. Second operand 41 states. [2018-04-11 22:54:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:31,508 INFO L93 Difference]: Finished difference Result 1275 states and 1284 transitions. [2018-04-11 22:54:31,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 22:54:31,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1103 [2018-04-11 22:54:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:31,510 INFO L225 Difference]: With dead ends: 1275 [2018-04-11 22:54:31,510 INFO L226 Difference]: Without dead ends: 1275 [2018-04-11 22:54:31,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1053 SyntacticMatches, 32 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1400, Invalid=4606, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 22:54:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-04-11 22:54:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1239. [2018-04-11 22:54:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-04-11 22:54:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1246 transitions. [2018-04-11 22:54:31,517 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1246 transitions. Word has length 1103 [2018-04-11 22:54:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:31,517 INFO L459 AbstractCegarLoop]: Abstraction has 1239 states and 1246 transitions. [2018-04-11 22:54:31,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 22:54:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1246 transitions. [2018-04-11 22:54:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2018-04-11 22:54:31,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:31,524 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-11 22:54:31,524 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-11 22:54:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash -230054690, now seen corresponding path program 33 times [2018-04-11 22:54:31,524 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:31,524 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:31,525 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:31,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:31,525 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:31,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:34,321 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-11 22:54:34,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:34,321 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:34,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:54:34,595 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-04-11 22:54:34,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:34,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 29661 proven. 2452 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-11 22:54:35,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:35,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 78 [2018-04-11 22:54:35,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 22:54:35,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 22:54:35,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=5181, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 22:54:35,719 INFO L87 Difference]: Start difference. First operand 1239 states and 1246 transitions. Second operand 78 states. [2018-04-11 22:54:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:37,930 INFO L93 Difference]: Finished difference Result 1394 states and 1400 transitions. [2018-04-11 22:54:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-11 22:54:37,930 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1217 [2018-04-11 22:54:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:37,933 INFO L225 Difference]: With dead ends: 1394 [2018-04-11 22:54:37,933 INFO L226 Difference]: Without dead ends: 1385 [2018-04-11 22:54:37,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1181 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7932 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3510, Invalid=20670, Unknown=0, NotChecked=0, Total=24180 [2018-04-11 22:54:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-04-11 22:54:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1368. [2018-04-11 22:54:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-04-11 22:54:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1374 transitions. [2018-04-11 22:54:37,941 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1374 transitions. Word has length 1217 [2018-04-11 22:54:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:37,942 INFO L459 AbstractCegarLoop]: Abstraction has 1368 states and 1374 transitions. [2018-04-11 22:54:37,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-11 22:54:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1374 transitions. [2018-04-11 22:54:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2018-04-11 22:54:37,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:37,948 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-11 22:54:37,948 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-11 22:54:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash -929947930, now seen corresponding path program 34 times [2018-04-11 22:54:37,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:37,949 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:37,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:37,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:37,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:38,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:40,521 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-11 22:54:40,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:40,521 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:40,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:54:40,799 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:54:40,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:40,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:40,812 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-11 22:54:40,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:54:40,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:54:40,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:54:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16520 proven. 3373 refuted. 0 times theorem prover too weak. 72919 trivial. 0 not checked. [2018-04-11 22:54:42,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:42,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 43 [2018-04-11 22:54:42,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 22:54:42,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 22:54:42,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1439, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 22:54:42,756 INFO L87 Difference]: Start difference. First operand 1368 states and 1374 transitions. Second operand 44 states. [2018-04-11 22:54:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:43,753 INFO L93 Difference]: Finished difference Result 1401 states and 1409 transitions. [2018-04-11 22:54:43,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 22:54:43,753 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1223 [2018-04-11 22:54:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:43,755 INFO L225 Difference]: With dead ends: 1401 [2018-04-11 22:54:43,755 INFO L226 Difference]: Without dead ends: 1401 [2018-04-11 22:54:43,756 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1170 SyntacticMatches, 33 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=750, Invalid=3032, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 22:54:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-04-11 22:54:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1374. [2018-04-11 22:54:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2018-04-11 22:54:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1381 transitions. [2018-04-11 22:54:43,763 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1381 transitions. Word has length 1223 [2018-04-11 22:54:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:43,763 INFO L459 AbstractCegarLoop]: Abstraction has 1374 states and 1381 transitions. [2018-04-11 22:54:43,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 22:54:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1381 transitions. [2018-04-11 22:54:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-04-11 22:54:43,770 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:43,770 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-11 22:54:43,770 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-11 22:54:43,770 INFO L82 PathProgramCache]: Analyzing trace with hash -920557010, now seen corresponding path program 35 times [2018-04-11 22:54:43,770 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:43,770 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:43,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:43,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:43,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:43,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:46,436 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-11 22:54:46,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:46,437 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:46,442 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:54:47,288 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-04-11 22:54:47,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:47,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 18471 proven. 4116 refuted. 0 times theorem prover too weak. 71275 trivial. 0 not checked. [2018-04-11 22:54:48,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:48,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 44] total 64 [2018-04-11 22:54:48,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-11 22:54:48,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-11 22:54:48,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3213, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 22:54:48,216 INFO L87 Difference]: Start difference. First operand 1374 states and 1381 transitions. Second operand 64 states. [2018-04-11 22:54:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:49,281 INFO L93 Difference]: Finished difference Result 1517 states and 1525 transitions. [2018-04-11 22:54:49,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 22:54:49,281 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1229 [2018-04-11 22:54:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:49,283 INFO L225 Difference]: With dead ends: 1517 [2018-04-11 22:54:49,284 INFO L226 Difference]: Without dead ends: 1517 [2018-04-11 22:54:49,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2228, Invalid=8074, Unknown=0, NotChecked=0, Total=10302 [2018-04-11 22:54:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-04-11 22:54:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1500. [2018-04-11 22:54:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2018-04-11 22:54:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1508 transitions. [2018-04-11 22:54:49,293 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1508 transitions. Word has length 1229 [2018-04-11 22:54:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:49,293 INFO L459 AbstractCegarLoop]: Abstraction has 1500 states and 1508 transitions. [2018-04-11 22:54:49,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-11 22:54:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1508 transitions. [2018-04-11 22:54:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1344 [2018-04-11 22:54:49,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:49,301 INFO L355 BasicCegarLoop]: trace histogram [205, 188, 188, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:54:49,301 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-11 22:54:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash -710434185, now seen corresponding path program 36 times [2018-04-11 22:54:49,301 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:49,302 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:49,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:49,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:49,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:54:49,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:54:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 39648 proven. 8202 refuted. 0 times theorem prover too weak. 65353 trivial. 0 not checked. [2018-04-11 22:54:52,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:54:52,746 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:54:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:54:53,864 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-04-11 22:54:53,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:54:53,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:54:53,881 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-11 22:54:53,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:54:53,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:54:53,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:54:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 19591 proven. 920 refuted. 0 times theorem prover too weak. 92692 trivial. 0 not checked. [2018-04-11 22:54:56,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:54:56,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 25] total 66 [2018-04-11 22:54:56,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 22:54:56,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 22:54:56,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=3730, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 22:54:56,852 INFO L87 Difference]: Start difference. First operand 1500 states and 1508 transitions. Second operand 66 states. [2018-04-11 22:54:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:54:59,914 INFO L93 Difference]: Finished difference Result 1652 states and 1660 transitions. [2018-04-11 22:54:59,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-11 22:54:59,914 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 1343 [2018-04-11 22:54:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:54:59,916 INFO L225 Difference]: With dead ends: 1652 [2018-04-11 22:54:59,917 INFO L226 Difference]: Without dead ends: 1643 [2018-04-11 22:54:59,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1469 GetRequests, 1288 SyntacticMatches, 33 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8552 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2963, Invalid=19387, Unknown=0, NotChecked=0, Total=22350 [2018-04-11 22:54:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2018-04-11 22:54:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1620. [2018-04-11 22:54:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2018-04-11 22:54:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1627 transitions. [2018-04-11 22:54:59,929 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1627 transitions. Word has length 1343 [2018-04-11 22:54:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:54:59,929 INFO L459 AbstractCegarLoop]: Abstraction has 1620 states and 1627 transitions. [2018-04-11 22:54:59,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 22:54:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1627 transitions. [2018-04-11 22:54:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1470 [2018-04-11 22:54:59,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:54:59,938 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-11 22:54:59,938 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-11 22:54:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1705644624, now seen corresponding path program 37 times [2018-04-11 22:54:59,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:54:59,939 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:54:59,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:59,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:54:59,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:54:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:00,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:55:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 44818 proven. 9625 refuted. 0 times theorem prover too weak. 82449 trivial. 0 not checked. [2018-04-11 22:55:04,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:55:04,195 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:55:04,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:55:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:04,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:55:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 42145 proven. 954 refuted. 0 times theorem prover too weak. 93793 trivial. 0 not checked. [2018-04-11 22:55:05,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:55:05,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40] total 72 [2018-04-11 22:55:05,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 22:55:05,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 22:55:05,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=4213, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 22:55:05,459 INFO L87 Difference]: Start difference. First operand 1620 states and 1627 transitions. Second operand 72 states. [2018-04-11 22:55:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:55:07,183 INFO L93 Difference]: Finished difference Result 1657 states and 1664 transitions. [2018-04-11 22:55:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-11 22:55:07,184 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1469 [2018-04-11 22:55:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:55:07,187 INFO L225 Difference]: With dead ends: 1657 [2018-04-11 22:55:07,187 INFO L226 Difference]: Without dead ends: 1651 [2018-04-11 22:55:07,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1562 GetRequests, 1444 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4637 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2601, Invalid=11679, Unknown=0, NotChecked=0, Total=14280 [2018-04-11 22:55:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-04-11 22:55:07,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1630. [2018-04-11 22:55:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2018-04-11 22:55:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1637 transitions. [2018-04-11 22:55:07,196 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1637 transitions. Word has length 1469 [2018-04-11 22:55:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:55:07,196 INFO L459 AbstractCegarLoop]: Abstraction has 1630 states and 1637 transitions. [2018-04-11 22:55:07,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 22:55:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1637 transitions. [2018-04-11 22:55:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2018-04-11 22:55:07,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:55:07,205 INFO L355 BasicCegarLoop]: trace histogram [226, 208, 208, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:55:07,205 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-11 22:55:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1936089384, now seen corresponding path program 38 times [2018-04-11 22:55:07,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:55:07,206 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:55:07,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:07,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:55:07,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:07,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:55:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 21870 proven. 990 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-11 22:55:10,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:55:10,861 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:55:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:55:11,101 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:55:11,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:55:11,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:55:11,115 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-11 22:55:11,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:55:11,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:55:11,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:55:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 21870 proven. 990 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-11 22:55:13,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:55:13,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 25 [2018-04-11 22:55:13,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 22:55:13,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 22:55:13,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=386, Unknown=0, NotChecked=0, Total=650 [2018-04-11 22:55:13,523 INFO L87 Difference]: Start difference. First operand 1630 states and 1637 transitions. Second operand 26 states. [2018-04-11 22:55:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:55:13,980 INFO L93 Difference]: Finished difference Result 1650 states and 1657 transitions. [2018-04-11 22:55:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 22:55:13,981 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1475 [2018-04-11 22:55:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:55:13,984 INFO L225 Difference]: With dead ends: 1650 [2018-04-11 22:55:13,984 INFO L226 Difference]: Without dead ends: 1650 [2018-04-11 22:55:13,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1517 GetRequests, 1436 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=721, Invalid=1259, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 22:55:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2018-04-11 22:55:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1632. [2018-04-11 22:55:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2018-04-11 22:55:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 1639 transitions. [2018-04-11 22:55:13,993 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 1639 transitions. Word has length 1475 [2018-04-11 22:55:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:55:13,994 INFO L459 AbstractCegarLoop]: Abstraction has 1632 states and 1639 transitions. [2018-04-11 22:55:13,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 22:55:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1639 transitions. [2018-04-11 22:55:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1482 [2018-04-11 22:55:14,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:55:14,003 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-11 22:55:14,003 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-11 22:55:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1693559968, now seen corresponding path program 39 times [2018-04-11 22:55:14,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:55:14,003 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:55:14,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:14,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:55:14,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:14,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:55:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-11 22:55:17,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:55:17,797 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:55:17,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:55:18,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-04-11 22:55:18,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:55:18,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:55:18,165 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-11 22:55:18,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:55:18,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:55:18,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:55:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-11 22:55:20,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:55:20,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2018-04-11 22:55:20,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 22:55:20,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 22:55:20,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=415, Unknown=0, NotChecked=0, Total=702 [2018-04-11 22:55:20,651 INFO L87 Difference]: Start difference. First operand 1632 states and 1639 transitions. Second operand 27 states. [2018-04-11 22:55:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:55:21,134 INFO L93 Difference]: Finished difference Result 1668 states and 1677 transitions. [2018-04-11 22:55:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 22:55:21,134 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1481 [2018-04-11 22:55:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:55:21,138 INFO L225 Difference]: With dead ends: 1668 [2018-04-11 22:55:21,138 INFO L226 Difference]: Without dead ends: 1668 [2018-04-11 22:55:21,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1525 GetRequests, 1442 SyntacticMatches, 38 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=788, Invalid=1374, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 22:55:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2018-04-11 22:55:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1638. [2018-04-11 22:55:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2018-04-11 22:55:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 1646 transitions. [2018-04-11 22:55:21,147 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 1646 transitions. Word has length 1481 [2018-04-11 22:55:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:55:21,148 INFO L459 AbstractCegarLoop]: Abstraction has 1638 states and 1646 transitions. [2018-04-11 22:55:21,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 22:55:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 1646 transitions. [2018-04-11 22:55:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2018-04-11 22:55:21,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:55:21,158 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-11 22:55:21,158 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-11 22:55:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1607842712, now seen corresponding path program 40 times [2018-04-11 22:55:21,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:55:21,158 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:55:21,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:21,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:55:21,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:21,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:55:25,415 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-11 22:55:25,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:55:25,415 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:55:25,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:55:25,595 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:55:25,595 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:55:25,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:55:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 25430 proven. 990 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-11 22:55:26,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:55:26,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 66 [2018-04-11 22:55:26,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 22:55:26,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 22:55:26,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=3299, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 22:55:26,683 INFO L87 Difference]: Start difference. First operand 1638 states and 1646 transitions. Second operand 66 states. [2018-04-11 22:55:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:55:27,762 INFO L93 Difference]: Finished difference Result 1796 states and 1805 transitions. [2018-04-11 22:55:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 22:55:27,762 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 1487 [2018-04-11 22:55:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:55:27,767 INFO L225 Difference]: With dead ends: 1796 [2018-04-11 22:55:27,767 INFO L226 Difference]: Without dead ends: 1796 [2018-04-11 22:55:27,768 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1569 GetRequests, 1466 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2782, Invalid=8138, Unknown=0, NotChecked=0, Total=10920 [2018-04-11 22:55:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2018-04-11 22:55:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1776. [2018-04-11 22:55:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-04-11 22:55:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1785 transitions. [2018-04-11 22:55:27,777 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1785 transitions. Word has length 1487 [2018-04-11 22:55:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:55:27,777 INFO L459 AbstractCegarLoop]: Abstraction has 1776 states and 1785 transitions. [2018-04-11 22:55:27,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 22:55:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1785 transitions. [2018-04-11 22:55:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1614 [2018-04-11 22:55:27,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:55:27,788 INFO L355 BasicCegarLoop]: trace histogram [248, 229, 229, 228, 228, 228, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:55:27,788 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-11 22:55:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 158683713, now seen corresponding path program 41 times [2018-04-11 22:55:27,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:55:27,789 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:55:27,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:27,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:55:27,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:27,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:55:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 167029 backedges. 68630 proven. 3474 refuted. 0 times theorem prover too weak. 94925 trivial. 0 not checked. [2018-04-11 22:55:33,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:55:33,048 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:55:33,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:55:34,427 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-11 22:55:34,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:55:34,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:55:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 167029 backedges. 50068 proven. 6466 refuted. 0 times theorem prover too weak. 110495 trivial. 0 not checked. [2018-04-11 22:55:35,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:55:35,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 86 [2018-04-11 22:55:35,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-11 22:55:35,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-11 22:55:35,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=6204, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 22:55:35,890 INFO L87 Difference]: Start difference. First operand 1776 states and 1785 transitions. Second operand 86 states. [2018-04-11 22:55:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:55:38,389 INFO L93 Difference]: Finished difference Result 1799 states and 1806 transitions. [2018-04-11 22:55:38,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-11 22:55:38,389 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1613 [2018-04-11 22:55:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:55:38,392 INFO L225 Difference]: With dead ends: 1799 [2018-04-11 22:55:38,392 INFO L226 Difference]: Without dead ends: 1793 [2018-04-11 22:55:38,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1575 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6971 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3628, Invalid=18128, Unknown=0, NotChecked=0, Total=21756 [2018-04-11 22:55:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-04-11 22:55:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1776. [2018-04-11 22:55:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-04-11 22:55:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1783 transitions. [2018-04-11 22:55:38,401 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1783 transitions. Word has length 1613 [2018-04-11 22:55:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:55:38,402 INFO L459 AbstractCegarLoop]: Abstraction has 1776 states and 1783 transitions. [2018-04-11 22:55:38,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-11 22:55:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1783 transitions. [2018-04-11 22:55:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2018-04-11 22:55:38,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:55:38,413 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-11 22:55:38,413 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__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-11 22:55:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2037889527, now seen corresponding path program 42 times [2018-04-11 22:55:38,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:55:38,413 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:55:38,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:38,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:55:38,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:38,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:55:42,841 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-11 22:55:42,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:55:42,842 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:55:42,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:55:43,742 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-04-11 22:55:43,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:55:43,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:55:43,758 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-11 22:55:43,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:55:43,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:55:43,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:55:46,500 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-11 22:55:46,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:55:46,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 27 [2018-04-11 22:55:46,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 22:55:46,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 22:55:46,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=445, Unknown=0, NotChecked=0, Total=756 [2018-04-11 22:55:46,523 INFO L87 Difference]: Start difference. First operand 1776 states and 1783 transitions. Second operand 28 states. [2018-04-11 22:55:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:55:47,002 INFO L93 Difference]: Finished difference Result 1802 states and 1810 transitions. [2018-04-11 22:55:47,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 22:55:47,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1619 [2018-04-11 22:55:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:55:47,005 INFO L225 Difference]: With dead ends: 1802 [2018-04-11 22:55:47,005 INFO L226 Difference]: Without dead ends: 1802 [2018-04-11 22:55:47,006 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-11 22:55:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-04-11 22:55:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1782. [2018-04-11 22:55:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2018-04-11 22:55:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 1790 transitions. [2018-04-11 22:55:47,013 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 1790 transitions. Word has length 1619 [2018-04-11 22:55:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:55:47,014 INFO L459 AbstractCegarLoop]: Abstraction has 1782 states and 1790 transitions. [2018-04-11 22:55:47,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 22:55:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 1790 transitions. [2018-04-11 22:55:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2018-04-11 22:55:47,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:55:47,025 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-11 22:55:47,025 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__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-11 22:55:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 85486353, now seen corresponding path program 43 times [2018-04-11 22:55:47,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:55:47,025 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:55:47,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:47,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:55:47,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:47,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:55:52,046 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-11 22:55:52,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:55:52,046 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:55:52,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:55:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:52,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:55:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 169855 backedges. 29369 proven. 1102 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-11 22:55:53,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:55:53,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 69 [2018-04-11 22:55:53,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-11 22:55:53,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-11 22:55:53,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=3610, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 22:55:53,515 INFO L87 Difference]: Start difference. First operand 1782 states and 1790 transitions. Second operand 69 states. [2018-04-11 22:55:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:55:54,660 INFO L93 Difference]: Finished difference Result 1940 states and 1949 transitions. [2018-04-11 22:55:54,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 22:55:54,660 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1625 [2018-04-11 22:55:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:55:54,663 INFO L225 Difference]: With dead ends: 1940 [2018-04-11 22:55:54,663 INFO L226 Difference]: Without dead ends: 1940 [2018-04-11 22:55:54,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1711 GetRequests, 1603 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3047, Invalid=8943, Unknown=0, NotChecked=0, Total=11990 [2018-04-11 22:55:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2018-04-11 22:55:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1920. [2018-04-11 22:55:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-04-11 22:55:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 1929 transitions. [2018-04-11 22:55:54,671 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 1929 transitions. Word has length 1625 [2018-04-11 22:55:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:55:54,672 INFO L459 AbstractCegarLoop]: Abstraction has 1920 states and 1929 transitions. [2018-04-11 22:55:54,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-11 22:55:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 1929 transitions. [2018-04-11 22:55:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2018-04-11 22:55:54,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:55:54,685 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-11 22:55:54,685 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__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-11 22:55:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1662420850, now seen corresponding path program 44 times [2018-04-11 22:55:54,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:55:54,686 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:55:54,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:54,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:55:54,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:55:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:55:54,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:56:00,998 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-11 22:56:00,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:56:00,998 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:56:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:56:01,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:56:01,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:56:01,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:56:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 58243 proven. 1180 refuted. 0 times theorem prover too weak. 140747 trivial. 0 not checked. [2018-04-11 22:56:02,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:56:02,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44] total 86 [2018-04-11 22:56:02,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-11 22:56:02,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-11 22:56:02,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=6109, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 22:56:02,967 INFO L87 Difference]: Start difference. First operand 1920 states and 1929 transitions. Second operand 86 states. [2018-04-11 22:56:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:56:05,432 INFO L93 Difference]: Finished difference Result 1943 states and 1950 transitions. [2018-04-11 22:56:05,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-11 22:56:05,432 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1757 [2018-04-11 22:56:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:56:05,435 INFO L225 Difference]: With dead ends: 1943 [2018-04-11 22:56:05,435 INFO L226 Difference]: Without dead ends: 1937 [2018-04-11 22:56:05,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1865 GetRequests, 1721 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3432, Invalid=17738, Unknown=0, NotChecked=0, Total=21170 [2018-04-11 22:56:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-04-11 22:56:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1920. [2018-04-11 22:56:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-04-11 22:56:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 1927 transitions. [2018-04-11 22:56:05,445 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 1927 transitions. Word has length 1757 [2018-04-11 22:56:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:56:05,446 INFO L459 AbstractCegarLoop]: Abstraction has 1920 states and 1927 transitions. [2018-04-11 22:56:05,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-11 22:56:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 1927 transitions. [2018-04-11 22:56:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-04-11 22:56:05,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:56:05,458 INFO L355 BasicCegarLoop]: trace histogram [272, 252, 252, 251, 251, 251, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:56:05,459 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__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-11 22:56:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash -840334726, now seen corresponding path program 45 times [2018-04-11 22:56:05,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:56:05,459 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:56:05,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:05,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:56:05,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:56:05,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:56:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 201714 backedges. 30800 proven. 1344 refuted. 0 times theorem prover too weak. 169570 trivial. 0 not checked. [2018-04-11 22:56:10,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:56:10,726 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:56:10,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:56:11,181 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-11 22:56:11,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:56:11,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:56:11,197 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-11 22:56:11,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:56:11,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:56:11,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:56:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 201714 backedges. 30800 proven. 1344 refuted. 0 times theorem prover too weak. 169570 trivial. 0 not checked. [2018-04-11 22:56:14,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:56:14,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 28 [2018-04-11 22:56:14,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 22:56:14,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 22:56:14,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=476, Unknown=0, NotChecked=0, Total=812 [2018-04-11 22:56:14,509 INFO L87 Difference]: Start difference. First operand 1920 states and 1927 transitions. Second operand 29 states. [2018-04-11 22:56:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:56:15,083 INFO L93 Difference]: Finished difference Result 1946 states and 1954 transitions. [2018-04-11 22:56:15,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 22:56:15,084 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1763 [2018-04-11 22:56:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:56:15,088 INFO L225 Difference]: With dead ends: 1946 [2018-04-11 22:56:15,089 INFO L226 Difference]: Without dead ends: 1946 [2018-04-11 22:56:15,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1811 GetRequests, 1720 SyntacticMatches, 42 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=931, Invalid=1619, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 22:56:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-04-11 22:56:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1926. [2018-04-11 22:56:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2018-04-11 22:56:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 1934 transitions. [2018-04-11 22:56:15,105 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 1934 transitions. Word has length 1763 [2018-04-11 22:56:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:56:15,106 INFO L459 AbstractCegarLoop]: Abstraction has 1926 states and 1934 transitions. [2018-04-11 22:56:15,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 22:56:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 1934 transitions. [2018-04-11 22:56:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1770 [2018-04-11 22:56:15,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:56:15,128 INFO L355 BasicCegarLoop]: trace histogram [273, 253, 253, 252, 252, 252, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:56:15,128 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__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-11 22:56:15,129 INFO L82 PathProgramCache]: Analyzing trace with hash -818098494, now seen corresponding path program 46 times [2018-04-11 22:56:15,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:56:15,129 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:56:15,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:15,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:56:15,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:56:15,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:56:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 203264 backedges. 33629 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-11 22:56:21,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:56:21,403 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:56:21,409 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:56:21,617 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:56:21,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:56:21,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:56:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 203264 backedges. 33694 proven. 1220 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-11 22:56:22,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:56:22,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 72 [2018-04-11 22:56:22,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 22:56:22,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 22:56:22,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=3935, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 22:56:22,984 INFO L87 Difference]: Start difference. First operand 1926 states and 1934 transitions. Second operand 72 states. [2018-04-11 22:56:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:56:24,289 INFO L93 Difference]: Finished difference Result 2090 states and 2099 transitions. [2018-04-11 22:56:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-11 22:56:24,289 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1769 [2018-04-11 22:56:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:56:24,291 INFO L225 Difference]: With dead ends: 2090 [2018-04-11 22:56:24,292 INFO L226 Difference]: Without dead ends: 2090 [2018-04-11 22:56:24,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1859 GetRequests, 1746 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3324, Invalid=9786, Unknown=0, NotChecked=0, Total=13110 [2018-04-11 22:56:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-04-11 22:56:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2070. [2018-04-11 22:56:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2018-04-11 22:56:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2079 transitions. [2018-04-11 22:56:24,307 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2079 transitions. Word has length 1769 [2018-04-11 22:56:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:56:24,308 INFO L459 AbstractCegarLoop]: Abstraction has 2070 states and 2079 transitions. [2018-04-11 22:56:24,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 22:56:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2079 transitions. [2018-04-11 22:56:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1908 [2018-04-11 22:56:24,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:56:24,333 INFO L355 BasicCegarLoop]: trace histogram [295, 274, 274, 273, 273, 273, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:56:24,333 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__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-11 22:56:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1085039659, now seen corresponding path program 47 times [2018-04-11 22:56:24,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:56:24,334 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:56:24,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:24,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:56:24,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:56:24,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:56:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 237993 backedges. 84836 proven. 8786 refuted. 0 times theorem prover too weak. 144371 trivial. 0 not checked. [2018-04-11 22:56:31,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:56:31,937 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:56:31,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:56:33,942 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-04-11 22:56:33,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:56:33,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:56:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 237993 backedges. 66454 proven. 7848 refuted. 0 times theorem prover too weak. 163691 trivial. 0 not checked. [2018-04-11 22:56:35,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:56:35,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 92 [2018-04-11 22:56:35,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-11 22:56:35,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-11 22:56:35,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=7092, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 22:56:35,682 INFO L87 Difference]: Start difference. First operand 2070 states and 2079 transitions. Second operand 92 states. [2018-04-11 22:56:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:56:37,779 INFO L93 Difference]: Finished difference Result 2093 states and 2100 transitions. [2018-04-11 22:56:37,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-11 22:56:37,779 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1907 [2018-04-11 22:56:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:56:37,782 INFO L225 Difference]: With dead ends: 2093 [2018-04-11 22:56:37,782 INFO L226 Difference]: Without dead ends: 2087 [2018-04-11 22:56:37,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2023 GetRequests, 1867 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8048 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4189, Invalid=20617, Unknown=0, NotChecked=0, Total=24806 [2018-04-11 22:56:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-04-11 22:56:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2070. [2018-04-11 22:56:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2018-04-11 22:56:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2077 transitions. [2018-04-11 22:56:37,800 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2077 transitions. Word has length 1907 [2018-04-11 22:56:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:56:37,801 INFO L459 AbstractCegarLoop]: Abstraction has 2070 states and 2077 transitions. [2018-04-11 22:56:37,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-11 22:56:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2077 transitions. [2018-04-11 22:56:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1914 [2018-04-11 22:56:37,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:56:37,825 INFO L355 BasicCegarLoop]: trace histogram [296, 275, 275, 274, 274, 274, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:56:37,825 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__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-11 22:56:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1885233037, now seen corresponding path program 48 times [2018-04-11 22:56:37,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:56:37,825 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:56:37,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:37,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:56:37,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:56:37,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:56:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 239677 backedges. 35259 proven. 1474 refuted. 0 times theorem prover too weak. 202944 trivial. 0 not checked. [2018-04-11 22:56:44,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:56:44,298 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:56:44,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:56:45,323 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-04-11 22:56:45,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:56:45,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:56:45,342 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-11 22:56:45,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:56:45,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:56:45,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:56:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 239677 backedges. 35259 proven. 1474 refuted. 0 times theorem prover too weak. 202944 trivial. 0 not checked. [2018-04-11 22:56:49,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:56:49,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 29 [2018-04-11 22:56:49,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 22:56:49,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 22:56:49,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=508, Unknown=0, NotChecked=0, Total=870 [2018-04-11 22:56:49,321 INFO L87 Difference]: Start difference. First operand 2070 states and 2077 transitions. Second operand 30 states. [2018-04-11 22:56:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:56:49,887 INFO L93 Difference]: Finished difference Result 2096 states and 2104 transitions. [2018-04-11 22:56:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 22:56:49,887 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1913 [2018-04-11 22:56:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:56:49,889 INFO L225 Difference]: With dead ends: 2096 [2018-04-11 22:56:49,890 INFO L226 Difference]: Without dead ends: 2096 [2018-04-11 22:56:49,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1963 GetRequests, 1868 SyntacticMatches, 44 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1007, Invalid=1749, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 22:56:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2018-04-11 22:56:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2076. [2018-04-11 22:56:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2076 states. [2018-04-11 22:56:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2084 transitions. [2018-04-11 22:56:49,899 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2084 transitions. Word has length 1913 [2018-04-11 22:56:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:56:49,899 INFO L459 AbstractCegarLoop]: Abstraction has 2076 states and 2084 transitions. [2018-04-11 22:56:49,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 22:56:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2084 transitions. [2018-04-11 22:56:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1920 [2018-04-11 22:56:49,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:56:49,914 INFO L355 BasicCegarLoop]: trace histogram [297, 276, 276, 275, 275, 275, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:56:49,914 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__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-11 22:56:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash -275067397, now seen corresponding path program 49 times [2018-04-11 22:56:49,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:56:49,914 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:56:49,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:49,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:56:49,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:56:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:56:50,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:56:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 241367 backedges. 38355 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-04-11 22:56:57,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:56:57,375 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:56:57,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:56:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:56:57,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:56:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 241367 backedges. 38423 proven. 1344 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-04-11 22:56:59,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:56:59,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 75 [2018-04-11 22:56:59,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 22:56:59,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 22:56:59,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1276, Invalid=4274, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 22:56:59,261 INFO L87 Difference]: Start difference. First operand 2076 states and 2084 transitions. Second operand 75 states. [2018-04-11 22:57:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:57:00,697 INFO L93 Difference]: Finished difference Result 2246 states and 2255 transitions. [2018-04-11 22:57:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-11 22:57:00,697 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 1919 [2018-04-11 22:57:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:57:00,700 INFO L225 Difference]: With dead ends: 2246 [2018-04-11 22:57:00,700 INFO L226 Difference]: Without dead ends: 2246 [2018-04-11 22:57:00,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2013 GetRequests, 1895 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2408 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3613, Invalid=10667, Unknown=0, NotChecked=0, Total=14280 [2018-04-11 22:57:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-04-11 22:57:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2226. [2018-04-11 22:57:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-04-11 22:57:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2235 transitions. [2018-04-11 22:57:00,710 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2235 transitions. Word has length 1919 [2018-04-11 22:57:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:57:00,711 INFO L459 AbstractCegarLoop]: Abstraction has 2226 states and 2235 transitions. [2018-04-11 22:57:00,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 22:57:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2235 transitions. [2018-04-11 22:57:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2064 [2018-04-11 22:57:00,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:57:00,728 INFO L355 BasicCegarLoop]: trace histogram [320, 298, 298, 297, 297, 297, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:57:00,728 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__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-11 22:57:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1741145324, now seen corresponding path program 50 times [2018-04-11 22:57:00,728 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:57:00,728 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:57:00,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:00,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:57:00,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:57:00,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:57:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 280918 backedges. 39986 proven. 1610 refuted. 0 times theorem prover too weak. 239322 trivial. 0 not checked. [2018-04-11 22:57:08,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:57:08,319 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:57:08,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:57:08,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:57:08,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:57:08,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:57:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 280918 backedges. 76257 proven. 1430 refuted. 0 times theorem prover too weak. 203231 trivial. 0 not checked. [2018-04-11 22:57:10,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:57:10,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 48] total 75 [2018-04-11 22:57:10,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 22:57:10,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 22:57:10,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=909, Invalid=4641, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 22:57:10,655 INFO L87 Difference]: Start difference. First operand 2226 states and 2235 transitions. Second operand 75 states. [2018-04-11 22:57:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:57:13,141 INFO L93 Difference]: Finished difference Result 2258 states and 2266 transitions. [2018-04-11 22:57:13,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-11 22:57:13,141 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 2063 [2018-04-11 22:57:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:57:13,144 INFO L225 Difference]: With dead ends: 2258 [2018-04-11 22:57:13,144 INFO L226 Difference]: Without dead ends: 2252 [2018-04-11 22:57:13,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2158 GetRequests, 2017 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5065 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3457, Invalid=16565, Unknown=0, NotChecked=0, Total=20022 [2018-04-11 22:57:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2018-04-11 22:57:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2232. [2018-04-11 22:57:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2018-04-11 22:57:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 2240 transitions. [2018-04-11 22:57:13,156 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 2240 transitions. Word has length 2063 [2018-04-11 22:57:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:57:13,156 INFO L459 AbstractCegarLoop]: Abstraction has 2232 states and 2240 transitions. [2018-04-11 22:57:13,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 22:57:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2240 transitions. [2018-04-11 22:57:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2076 [2018-04-11 22:57:13,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:57:13,174 INFO L355 BasicCegarLoop]: trace histogram [322, 300, 300, 299, 299, 299, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:57:13,174 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__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-11 22:57:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1843168572, now seen corresponding path program 51 times [2018-04-11 22:57:13,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:57:13,174 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:57:13,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:13,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:57:13,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:57:13,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:57:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 284584 backedges. 41822 proven. 1752 refuted. 0 times theorem prover too weak. 241010 trivial. 0 not checked. [2018-04-11 22:57:21,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:57:21,000 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:57:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:57:21,695 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-04-11 22:57:21,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:57:21,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:57:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 284584 backedges. 76647 proven. 4972 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-04-11 22:57:24,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:57:24,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 55] total 83 [2018-04-11 22:57:24,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-11 22:57:24,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-11 22:57:24,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1043, Invalid=5763, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 22:57:24,172 INFO L87 Difference]: Start difference. First operand 2232 states and 2240 transitions. Second operand 83 states. [2018-04-11 22:57:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:57:27,546 INFO L93 Difference]: Finished difference Result 2422 states and 2432 transitions. [2018-04-11 22:57:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-11 22:57:27,546 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 2075 [2018-04-11 22:57:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:57:27,550 INFO L225 Difference]: With dead ends: 2422 [2018-04-11 22:57:27,550 INFO L226 Difference]: Without dead ends: 2422 [2018-04-11 22:57:27,552 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2184 GetRequests, 2022 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6781 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5072, Invalid=21334, Unknown=0, NotChecked=0, Total=26406 [2018-04-11 22:57:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2018-04-11 22:57:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2400. [2018-04-11 22:57:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2018-04-11 22:57:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 2410 transitions. [2018-04-11 22:57:27,563 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 2410 transitions. Word has length 2075 [2018-04-11 22:57:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:57:27,563 INFO L459 AbstractCegarLoop]: Abstraction has 2400 states and 2410 transitions. [2018-04-11 22:57:27,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-11 22:57:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2410 transitions. [2018-04-11 22:57:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2238 [2018-04-11 22:57:27,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:57:27,583 INFO L355 BasicCegarLoop]: trace histogram [348, 325, 325, 324, 324, 324, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:57:27,583 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__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-11 22:57:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1102393595, now seen corresponding path program 52 times [2018-04-11 22:57:27,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:57:27,583 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:57:27,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:27,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:57:27,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:57:27,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:57:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 333353 backedges. 49091 proven. 1684 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-04-11 22:57:38,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:57:38,728 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:57:38,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:57:39,018 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:57:39,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:57:39,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:57:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 333353 backedges. 49165 proven. 1610 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-04-11 22:57:41,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:57:41,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 81 [2018-04-11 22:57:41,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-11 22:57:41,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-11 22:57:41,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1486, Invalid=4994, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 22:57:41,078 INFO L87 Difference]: Start difference. First operand 2400 states and 2410 transitions. Second operand 81 states. [2018-04-11 22:57:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:57:42,626 INFO L93 Difference]: Finished difference Result 2752 states and 2767 transitions. [2018-04-11 22:57:42,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-11 22:57:42,626 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 2237 [2018-04-11 22:57:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:57:42,630 INFO L225 Difference]: With dead ends: 2752 [2018-04-11 22:57:42,630 INFO L226 Difference]: Without dead ends: 2752 [2018-04-11 22:57:42,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2339 GetRequests, 2211 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2843 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4227, Invalid=12543, Unknown=0, NotChecked=0, Total=16770 [2018-04-11 22:57:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2018-04-11 22:57:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2730. [2018-04-11 22:57:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2018-04-11 22:57:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 2745 transitions. [2018-04-11 22:57:42,644 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 2745 transitions. Word has length 2237 [2018-04-11 22:57:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:57:42,644 INFO L459 AbstractCegarLoop]: Abstraction has 2730 states and 2745 transitions. [2018-04-11 22:57:42,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-11 22:57:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 2745 transitions. [2018-04-11 22:57:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2388 [2018-04-11 22:57:42,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:57:42,668 INFO L355 BasicCegarLoop]: trace histogram [372, 348, 348, 347, 347, 347, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:57:42,668 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__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-11 22:57:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash -623771714, now seen corresponding path program 53 times [2018-04-11 22:57:42,668 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:57:42,669 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:57:42,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:42,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:57:42,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:57:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:57:42,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:57:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 381710 backedges. 109985 proven. 20824 refuted. 0 times theorem prover too weak. 250901 trivial. 0 not checked. [2018-04-11 22:57:55,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:57:55,054 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:57:55,060 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 22:57:58,695 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2018-04-11 22:57:58,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:57:58,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:58:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 381710 backedges. 132784 proven. 9358 refuted. 0 times theorem prover too weak. 239568 trivial. 0 not checked. [2018-04-11 22:58:01,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:58:01,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 98 [2018-04-11 22:58:01,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-11 22:58:01,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-11 22:58:01,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1470, Invalid=8036, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 22:58:01,112 INFO L87 Difference]: Start difference. First operand 2730 states and 2745 transitions. Second operand 98 states. [2018-04-11 22:58:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:58:03,952 INFO L93 Difference]: Finished difference Result 2580 states and 2589 transitions. [2018-04-11 22:58:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-11 22:58:03,953 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 2387 [2018-04-11 22:58:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:58:03,956 INFO L225 Difference]: With dead ends: 2580 [2018-04-11 22:58:03,956 INFO L226 Difference]: Without dead ends: 2571 [2018-04-11 22:58:03,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2511 GetRequests, 2345 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9201 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4794, Invalid=23262, Unknown=0, NotChecked=0, Total=28056 [2018-04-11 22:58:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-04-11 22:58:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2556. [2018-04-11 22:58:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2018-04-11 22:58:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 2565 transitions. [2018-04-11 22:58:03,970 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 2565 transitions. Word has length 2387 [2018-04-11 22:58:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:58:03,970 INFO L459 AbstractCegarLoop]: Abstraction has 2556 states and 2565 transitions. [2018-04-11 22:58:03,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-11 22:58:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 2565 transitions. [2018-04-11 22:58:03,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2394 [2018-04-11 22:58:03,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:58:03,993 INFO L355 BasicCegarLoop]: trace histogram [373, 349, 349, 348, 348, 348, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:58:03,993 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__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-11 22:58:03,993 INFO L82 PathProgramCache]: Analyzing trace with hash -808142202, now seen corresponding path program 54 times [2018-04-11 22:58:03,993 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:58:03,994 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:58:03,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:58:03,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:58:03,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:58:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:58:04,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:58:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 383844 backedges. 115280 proven. 17669 refuted. 0 times theorem prover too weak. 250895 trivial. 0 not checked. [2018-04-11 22:58:16,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:58:16,608 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:58:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 22:58:18,805 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-04-11 22:58:18,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:58:18,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:58:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 383844 backedges. 94229 proven. 5404 refuted. 0 times theorem prover too weak. 284211 trivial. 0 not checked. [2018-04-11 22:58:21,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:58:21,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 57] total 110 [2018-04-11 22:58:21,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-11 22:58:21,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-11 22:58:21,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=10305, Unknown=0, NotChecked=0, Total=11990 [2018-04-11 22:58:21,745 INFO L87 Difference]: Start difference. First operand 2556 states and 2565 transitions. Second operand 110 states. [2018-04-11 22:58:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:58:25,320 INFO L93 Difference]: Finished difference Result 2581 states and 2588 transitions. [2018-04-11 22:58:25,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-04-11 22:58:25,320 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 2393 [2018-04-11 22:58:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:58:25,323 INFO L225 Difference]: With dead ends: 2581 [2018-04-11 22:58:25,323 INFO L226 Difference]: Without dead ends: 2575 [2018-04-11 22:58:25,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2559 GetRequests, 2341 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16160 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7070, Invalid=41110, Unknown=0, NotChecked=0, Total=48180 [2018-04-11 22:58:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2018-04-11 22:58:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2556. [2018-04-11 22:58:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2018-04-11 22:58:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 2563 transitions. [2018-04-11 22:58:25,337 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 2563 transitions. Word has length 2393 [2018-04-11 22:58:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:58:25,338 INFO L459 AbstractCegarLoop]: Abstraction has 2556 states and 2563 transitions. [2018-04-11 22:58:25,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-11 22:58:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 2563 transitions. [2018-04-11 22:58:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2400 [2018-04-11 22:58:25,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:58:25,361 INFO L355 BasicCegarLoop]: trace histogram [374, 350, 350, 349, 349, 349, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:58:25,361 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__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-11 22:58:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash -489433458, now seen corresponding path program 55 times [2018-04-11 22:58:25,362 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:58:25,362 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:58:25,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:58:25,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:58:25,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:58:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:58:25,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:58:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 385984 backedges. 51168 proven. 1900 refuted. 0 times theorem prover too weak. 332916 trivial. 0 not checked. [2018-04-11 22:58:35,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:58:35,532 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:58:35,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:58:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:58:35,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:58:35,903 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-11 22:58:35,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:58:35,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:58:35,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:58:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 385984 backedges. 51168 proven. 1900 refuted. 0 times theorem prover too weak. 332916 trivial. 0 not checked. [2018-04-11 22:58:42,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:58:42,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 56 [2018-04-11 22:58:42,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 22:58:42,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 22:58:42,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=2350, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 22:58:42,199 INFO L87 Difference]: Start difference. First operand 2556 states and 2563 transitions. Second operand 57 states. [2018-04-11 22:58:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:58:44,177 INFO L93 Difference]: Finished difference Result 2582 states and 2590 transitions. [2018-04-11 22:58:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 22:58:44,177 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 2399 [2018-04-11 22:58:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:58:44,180 INFO L225 Difference]: With dead ends: 2582 [2018-04-11 22:58:44,180 INFO L226 Difference]: Without dead ends: 2582 [2018-04-11 22:58:44,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2455 GetRequests, 2324 SyntacticMatches, 50 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1348, Invalid=5458, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 22:58:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2018-04-11 22:58:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2562. [2018-04-11 22:58:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2018-04-11 22:58:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 2570 transitions. [2018-04-11 22:58:44,191 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 2570 transitions. Word has length 2399 [2018-04-11 22:58:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:58:44,192 INFO L459 AbstractCegarLoop]: Abstraction has 2562 states and 2570 transitions. [2018-04-11 22:58:44,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 22:58:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 2570 transitions. [2018-04-11 22:58:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2406 [2018-04-11 22:58:44,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:58:44,214 INFO L355 BasicCegarLoop]: trace histogram [375, 351, 351, 350, 350, 350, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:58:44,214 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__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-11 22:58:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1173044266, now seen corresponding path program 56 times [2018-04-11 22:58:44,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:58:44,215 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:58:44,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:58:44,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:58:44,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:58:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:58:44,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:58:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 388130 backedges. 55137 proven. 1829 refuted. 0 times theorem prover too weak. 331164 trivial. 0 not checked. [2018-04-11 22:58:56,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:58:56,776 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:58:56,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 22:58:57,131 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 22:58:57,132 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:58:57,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:59:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 388130 backedges. 55060 proven. 1906 refuted. 0 times theorem prover too weak. 331164 trivial. 0 not checked. [2018-04-11 22:59:00,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:59:00,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 57] total 112 [2018-04-11 22:59:00,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-04-11 22:59:00,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-04-11 22:59:00,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2226, Invalid=10206, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 22:59:00,251 INFO L87 Difference]: Start difference. First operand 2562 states and 2570 transitions. Second operand 112 states. [2018-04-11 22:59:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:59:02,956 INFO L93 Difference]: Finished difference Result 2750 states and 2759 transitions. [2018-04-11 22:59:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-11 22:59:02,956 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 2405 [2018-04-11 22:59:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:59:02,960 INFO L225 Difference]: With dead ends: 2750 [2018-04-11 22:59:02,960 INFO L226 Difference]: Without dead ends: 2750 [2018-04-11 22:59:02,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2513 GetRequests, 2350 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7984 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5370, Invalid=21690, Unknown=0, NotChecked=0, Total=27060 [2018-04-11 22:59:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2018-04-11 22:59:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2730. [2018-04-11 22:59:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2018-04-11 22:59:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 2739 transitions. [2018-04-11 22:59:02,972 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 2739 transitions. Word has length 2405 [2018-04-11 22:59:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:59:02,973 INFO L459 AbstractCegarLoop]: Abstraction has 2730 states and 2739 transitions. [2018-04-11 22:59:02,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-04-11 22:59:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 2739 transitions. [2018-04-11 22:59:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2568 [2018-04-11 22:59:02,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:59:02,998 INFO L355 BasicCegarLoop]: trace histogram [401, 376, 376, 375, 375, 375, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:59:02,998 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__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-11 22:59:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash 185613919, now seen corresponding path program 57 times [2018-04-11 22:59:02,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:59:02,999 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:59:02,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:59:02,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:59:02,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:59:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:59:03,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:59:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 444775 backedges. 127208 proven. 20874 refuted. 0 times theorem prover too weak. 296693 trivial. 0 not checked. [2018-04-11 22:59:17,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:59:17,838 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:59:17,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 22:59:18,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-04-11 22:59:18,598 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:59:18,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:59:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 444775 backedges. 105981 proven. 5854 refuted. 0 times theorem prover too weak. 332940 trivial. 0 not checked. [2018-04-11 22:59:21,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:59:21,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 59] total 114 [2018-04-11 22:59:21,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-11 22:59:21,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-11 22:59:21,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1803, Invalid=11079, Unknown=0, NotChecked=0, Total=12882 [2018-04-11 22:59:21,747 INFO L87 Difference]: Start difference. First operand 2730 states and 2739 transitions. Second operand 114 states. [2018-04-11 22:59:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:59:25,711 INFO L93 Difference]: Finished difference Result 2755 states and 2762 transitions. [2018-04-11 22:59:25,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-11 22:59:25,711 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 2567 [2018-04-11 22:59:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:59:25,714 INFO L225 Difference]: With dead ends: 2755 [2018-04-11 22:59:25,714 INFO L226 Difference]: Without dead ends: 2749 [2018-04-11 22:59:25,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2740 GetRequests, 2513 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17642 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7576, Invalid=44636, Unknown=0, NotChecked=0, Total=52212 [2018-04-11 22:59:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2018-04-11 22:59:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2730. [2018-04-11 22:59:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2018-04-11 22:59:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 2737 transitions. [2018-04-11 22:59:25,725 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 2737 transitions. Word has length 2567 [2018-04-11 22:59:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:59:25,726 INFO L459 AbstractCegarLoop]: Abstraction has 2730 states and 2737 transitions. [2018-04-11 22:59:25,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-11 22:59:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 2737 transitions. [2018-04-11 22:59:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2574 [2018-04-11 22:59:25,749 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:59:25,750 INFO L355 BasicCegarLoop]: trace histogram [402, 377, 377, 376, 376, 376, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:59:25,750 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__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-11 22:59:25,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2140128167, now seen corresponding path program 58 times [2018-04-11 22:59:25,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:59:25,750 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:59:25,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:59:25,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:59:25,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:59:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:59:25,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:59:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 447079 backedges. 57375 proven. 2054 refuted. 0 times theorem prover too weak. 387650 trivial. 0 not checked. [2018-04-11 22:59:37,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:59:37,620 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 22:59:37,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 22:59:38,425 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 22:59:38,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 22:59:38,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:59:38,454 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-11 22:59:38,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:59:38,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:59:38,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:59:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 447079 backedges. 57101 proven. 7522 refuted. 0 times theorem prover too weak. 382456 trivial. 0 not checked. [2018-04-11 22:59:45,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:59:45,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 61 [2018-04-11 22:59:45,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-11 22:59:45,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-11 22:59:45,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=912, Invalid=2870, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 22:59:45,713 INFO L87 Difference]: Start difference. First operand 2730 states and 2737 transitions. Second operand 62 states. [2018-04-11 22:59:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:59:47,590 INFO L93 Difference]: Finished difference Result 2756 states and 2764 transitions. [2018-04-11 22:59:47,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 22:59:47,590 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2573 [2018-04-11 22:59:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:59:47,594 INFO L225 Difference]: With dead ends: 2756 [2018-04-11 22:59:47,594 INFO L226 Difference]: Without dead ends: 2756 [2018-04-11 22:59:47,594 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2631 GetRequests, 2493 SyntacticMatches, 51 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1479, Invalid=6353, Unknown=0, NotChecked=0, Total=7832 [2018-04-11 22:59:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2018-04-11 22:59:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2736. [2018-04-11 22:59:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2018-04-11 22:59:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 2744 transitions. [2018-04-11 22:59:47,605 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 2744 transitions. Word has length 2573 [2018-04-11 22:59:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:59:47,606 INFO L459 AbstractCegarLoop]: Abstraction has 2736 states and 2744 transitions. [2018-04-11 22:59:47,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-11 22:59:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 2744 transitions. [2018-04-11 22:59:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2580 [2018-04-11 22:59:47,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:59:47,631 INFO L355 BasicCegarLoop]: trace histogram [403, 378, 378, 377, 377, 377, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:59:47,631 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__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-11 22:59:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash -303646161, now seen corresponding path program 59 times [2018-04-11 22:59:47,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:59:47,631 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:59:47,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:59:47,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 22:59:47,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:59:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:59:47,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:00:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 449389 backedges. 61659 proven. 1980 refuted. 0 times theorem prover too weak. 385750 trivial. 0 not checked. [2018-04-11 23:00:02,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:00:02,428 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:00:02,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 23:00:07,365 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2018-04-11 23:00:07,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:00:07,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:00:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 449389 backedges. 61551 proven. 11426 refuted. 0 times theorem prover too weak. 376412 trivial. 0 not checked. [2018-04-11 23:00:10,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:00:10,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 62] total 92 [2018-04-11 23:00:10,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-11 23:00:10,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-11 23:00:10,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1707, Invalid=6665, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 23:00:10,130 INFO L87 Difference]: Start difference. First operand 2736 states and 2744 transitions. Second operand 92 states. [2018-04-11 23:00:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:00:12,310 INFO L93 Difference]: Finished difference Result 2930 states and 2939 transitions. [2018-04-11 23:00:12,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-11 23:00:12,310 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 2579 [2018-04-11 23:00:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:00:12,314 INFO L225 Difference]: With dead ends: 2930 [2018-04-11 23:00:12,314 INFO L226 Difference]: Without dead ends: 2930 [2018-04-11 23:00:12,315 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2693 GetRequests, 2546 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4227 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4744, Invalid=17308, Unknown=0, NotChecked=0, Total=22052 [2018-04-11 23:00:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2018-04-11 23:00:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2910. [2018-04-11 23:00:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2018-04-11 23:00:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 2919 transitions. [2018-04-11 23:00:12,327 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 2919 transitions. Word has length 2579 [2018-04-11 23:00:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:00:12,328 INFO L459 AbstractCegarLoop]: Abstraction has 2910 states and 2919 transitions. [2018-04-11 23:00:12,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-11 23:00:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 2919 transitions. [2018-04-11 23:00:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2748 [2018-04-11 23:00:12,354 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:00:12,355 INFO L355 BasicCegarLoop]: trace histogram [430, 404, 404, 403, 403, 403, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:00:12,355 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__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-11 23:00:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2000509888, now seen corresponding path program 60 times [2018-04-11 23:00:12,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:00:12,355 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:00:12,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:00:12,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:00:12,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:00:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:00:12,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:00:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 512668 backedges. 140086 proven. 24201 refuted. 0 times theorem prover too weak. 348381 trivial. 0 not checked. [2018-04-11 23:00:29,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:00:29,902 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:00:29,909 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 23:00:33,188 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-11 23:00:33,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:00:33,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:00:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 512668 backedges. 118671 proven. 6322 refuted. 0 times theorem prover too weak. 387675 trivial. 0 not checked. [2018-04-11 23:00:36,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:00:36,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 61] total 118 [2018-04-11 23:00:36,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-11 23:00:36,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-11 23:00:36,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=11880, Unknown=0, NotChecked=0, Total=13806 [2018-04-11 23:00:36,731 INFO L87 Difference]: Start difference. First operand 2910 states and 2919 transitions. Second operand 118 states. [2018-04-11 23:00:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:00:40,750 INFO L93 Difference]: Finished difference Result 2935 states and 2942 transitions. [2018-04-11 23:00:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-11 23:00:40,750 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 2747 [2018-04-11 23:00:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:00:40,753 INFO L225 Difference]: With dead ends: 2935 [2018-04-11 23:00:40,753 INFO L226 Difference]: Without dead ends: 2929 [2018-04-11 23:00:40,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2927 GetRequests, 2691 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19186 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8103, Invalid=48303, Unknown=0, NotChecked=0, Total=56406 [2018-04-11 23:00:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2018-04-11 23:00:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2910. [2018-04-11 23:00:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2018-04-11 23:00:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 2917 transitions. [2018-04-11 23:00:40,765 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 2917 transitions. Word has length 2747 [2018-04-11 23:00:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:00:40,766 INFO L459 AbstractCegarLoop]: Abstraction has 2910 states and 2917 transitions. [2018-04-11 23:00:40,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-11 23:00:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 2917 transitions. [2018-04-11 23:00:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2754 [2018-04-11 23:00:40,794 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:00:40,795 INFO L355 BasicCegarLoop]: trace histogram [431, 405, 405, 404, 404, 404, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:00:40,795 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__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-11 23:00:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2094076728, now seen corresponding path program 61 times [2018-04-11 23:00:40,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:00:40,795 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:00:40,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:00:40,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:00:40,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:00:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:00:40,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:00:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 515142 backedges. 64064 proven. 2214 refuted. 0 times theorem prover too weak. 448864 trivial. 0 not checked. [2018-04-11 23:00:54,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:00:54,438 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:00:54,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 23:00:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:00:54,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:00:54,872 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-11 23:00:54,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:00:54,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:00:54,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:01:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 515142 backedges. 64064 proven. 2214 refuted. 0 times theorem prover too weak. 448864 trivial. 0 not checked. [2018-04-11 23:01:02,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:01:02,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 60 [2018-04-11 23:01:02,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 23:01:02,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 23:01:02,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=962, Invalid=2698, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 23:01:02,965 INFO L87 Difference]: Start difference. First operand 2910 states and 2917 transitions. Second operand 61 states. [2018-04-11 23:01:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:01:05,243 INFO L93 Difference]: Finished difference Result 2936 states and 2944 transitions. [2018-04-11 23:01:05,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 23:01:05,243 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 2753 [2018-04-11 23:01:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:01:05,247 INFO L225 Difference]: With dead ends: 2936 [2018-04-11 23:01:05,247 INFO L226 Difference]: Without dead ends: 2936 [2018-04-11 23:01:05,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2813 GetRequests, 2672 SyntacticMatches, 54 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2375 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1535, Invalid=6297, Unknown=0, NotChecked=0, Total=7832 [2018-04-11 23:01:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2018-04-11 23:01:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2916. [2018-04-11 23:01:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2018-04-11 23:01:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 2924 transitions. [2018-04-11 23:01:05,259 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 2924 transitions. Word has length 2753 [2018-04-11 23:01:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:01:05,260 INFO L459 AbstractCegarLoop]: Abstraction has 2916 states and 2924 transitions. [2018-04-11 23:01:05,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-11 23:01:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 2924 transitions. [2018-04-11 23:01:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2760 [2018-04-11 23:01:05,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:01:05,288 INFO L355 BasicCegarLoop]: trace histogram [432, 406, 406, 405, 405, 405, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:01:05,288 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__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-11 23:01:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash 795920016, now seen corresponding path program 62 times [2018-04-11 23:01:05,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:01:05,288 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:01:05,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:01:05,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 23:01:05,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:01:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:01:05,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:01:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 517622 backedges. 68675 proven. 2137 refuted. 0 times theorem prover too weak. 446810 trivial. 0 not checked. [2018-04-11 23:01:22,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:01:22,474 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:01:22,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 23:01:22,879 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 23:01:22,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:01:22,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:01:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 517622 backedges. 68592 proven. 2220 refuted. 0 times theorem prover too weak. 446810 trivial. 0 not checked. [2018-04-11 23:01:26,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:01:26,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 61] total 120 [2018-04-11 23:01:26,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-11 23:01:26,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-11 23:01:26,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2564, Invalid=11716, Unknown=0, NotChecked=0, Total=14280 [2018-04-11 23:01:26,767 INFO L87 Difference]: Start difference. First operand 2916 states and 2924 transitions. Second operand 120 states. [2018-04-11 23:01:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:01:28,894 INFO L93 Difference]: Finished difference Result 3116 states and 3125 transitions. [2018-04-11 23:01:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-11 23:01:28,894 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 2759 [2018-04-11 23:01:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:01:28,898 INFO L225 Difference]: With dead ends: 3116 [2018-04-11 23:01:28,898 INFO L226 Difference]: Without dead ends: 3116 [2018-04-11 23:01:28,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2875 GetRequests, 2700 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9243 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6174, Invalid=24978, Unknown=0, NotChecked=0, Total=31152 [2018-04-11 23:01:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2018-04-11 23:01:28,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3096. [2018-04-11 23:01:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2018-04-11 23:01:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3105 transitions. [2018-04-11 23:01:28,912 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3105 transitions. Word has length 2759 [2018-04-11 23:01:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:01:28,913 INFO L459 AbstractCegarLoop]: Abstraction has 3096 states and 3105 transitions. [2018-04-11 23:01:28,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-11 23:01:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3105 transitions. [2018-04-11 23:01:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2934 [2018-04-11 23:01:28,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:01:28,945 INFO L355 BasicCegarLoop]: trace histogram [460, 433, 433, 432, 432, 432, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:01:28,945 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__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-11 23:01:28,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1868726615, now seen corresponding path program 63 times [2018-04-11 23:01:28,945 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:01:28,945 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:01:28,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:01:28,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:01:28,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:01:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:01:29,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:01:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 588033 backedges. 191070 proven. 6882 refuted. 0 times theorem prover too weak. 390081 trivial. 0 not checked. [2018-04-11 23:01:49,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:01:49,513 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:01:49,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 23:01:50,702 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-04-11 23:01:50,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:01:50,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:01:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 588033 backedges. 132335 proven. 6808 refuted. 0 times theorem prover too weak. 448890 trivial. 0 not checked. [2018-04-11 23:01:54,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:01:54,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 63] total 122 [2018-04-11 23:01:54,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-11 23:01:54,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-11 23:01:54,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2190, Invalid=12572, Unknown=0, NotChecked=0, Total=14762 [2018-04-11 23:01:54,667 INFO L87 Difference]: Start difference. First operand 3096 states and 3105 transitions. Second operand 122 states. [2018-04-11 23:01:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:01:58,904 INFO L93 Difference]: Finished difference Result 3121 states and 3128 transitions. [2018-04-11 23:01:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-04-11 23:01:58,904 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 2933 [2018-04-11 23:01:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:01:58,907 INFO L225 Difference]: With dead ends: 3121 [2018-04-11 23:01:58,907 INFO L226 Difference]: Without dead ends: 3115 [2018-04-11 23:01:58,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3111 GetRequests, 2875 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18442 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8948, Invalid=47458, Unknown=0, NotChecked=0, Total=56406 [2018-04-11 23:01:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2018-04-11 23:01:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3096. [2018-04-11 23:01:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2018-04-11 23:01:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3103 transitions. [2018-04-11 23:01:58,921 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3103 transitions. Word has length 2933 [2018-04-11 23:01:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:01:58,921 INFO L459 AbstractCegarLoop]: Abstraction has 3096 states and 3103 transitions. [2018-04-11 23:01:58,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-11 23:01:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3103 transitions. [2018-04-11 23:01:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2940 [2018-04-11 23:01:58,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:01:58,952 INFO L355 BasicCegarLoop]: trace histogram [461, 434, 434, 433, 433, 433, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:01:58,952 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__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-11 23:01:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash -326433679, now seen corresponding path program 64 times [2018-04-11 23:01:58,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:01:58,952 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:01:58,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:01:58,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:01:58,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:01:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:01:59,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:02:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 590683 backedges. 71253 proven. 2380 refuted. 0 times theorem prover too weak. 517050 trivial. 0 not checked. [2018-04-11 23:02:14,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:02:14,773 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:02:14,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 23:02:15,762 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 23:02:15,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:02:15,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:02:15,796 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-11 23:02:15,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:02:15,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:02:15,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:02:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 590683 backedges. 70959 proven. 8664 refuted. 0 times theorem prover too weak. 511060 trivial. 0 not checked. [2018-04-11 23:02:24,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:02:24,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 65 [2018-04-11 23:02:24,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 23:02:24,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 23:02:24,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1036, Invalid=3254, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 23:02:24,948 INFO L87 Difference]: Start difference. First operand 3096 states and 3103 transitions. Second operand 66 states. [2018-04-11 23:02:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:02:26,707 INFO L93 Difference]: Finished difference Result 3122 states and 3130 transitions. [2018-04-11 23:02:26,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 23:02:26,707 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 2939 [2018-04-11 23:02:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:02:26,711 INFO L225 Difference]: With dead ends: 3122 [2018-04-11 23:02:26,711 INFO L226 Difference]: Without dead ends: 3122 [2018-04-11 23:02:26,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3001 GetRequests, 2853 SyntacticMatches, 55 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2778 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1674, Invalid=7256, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 23:02:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2018-04-11 23:02:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3102. [2018-04-11 23:02:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-04-11 23:02:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 3110 transitions. [2018-04-11 23:02:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 3110 transitions. Word has length 2939 [2018-04-11 23:02:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:02:26,726 INFO L459 AbstractCegarLoop]: Abstraction has 3102 states and 3110 transitions. [2018-04-11 23:02:26,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 23:02:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 3110 transitions. [2018-04-11 23:02:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2946 [2018-04-11 23:02:26,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:02:26,758 INFO L355 BasicCegarLoop]: trace histogram [462, 435, 435, 434, 434, 434, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:02:26,758 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__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-11 23:02:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1088636039, now seen corresponding path program 65 times [2018-04-11 23:02:26,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:02:26,758 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:02:26,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:02:26,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:02:26,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:02:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:02:26,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:02:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 593339 backedges. 76203 proven. 2300 refuted. 0 times theorem prover too weak. 514836 trivial. 0 not checked. [2018-04-11 23:02:46,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:02:46,853 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:02:46,859 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 23:02:53,744 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2018-04-11 23:02:53,744 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:02:53,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:02:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 593339 backedges. 76081 proven. 13216 refuted. 0 times theorem prover too weak. 504042 trivial. 0 not checked. [2018-04-11 23:02:57,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:02:57,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 66] total 98 [2018-04-11 23:02:57,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-11 23:02:57,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-11 23:02:57,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1947, Invalid=7559, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 23:02:57,174 INFO L87 Difference]: Start difference. First operand 3102 states and 3110 transitions. Second operand 98 states. [2018-04-11 23:02:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:02:59,313 INFO L93 Difference]: Finished difference Result 3308 states and 3317 transitions. [2018-04-11 23:02:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-11 23:02:59,314 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 2945 [2018-04-11 23:02:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:02:59,317 INFO L225 Difference]: With dead ends: 3308 [2018-04-11 23:02:59,317 INFO L226 Difference]: Without dead ends: 3308 [2018-04-11 23:02:59,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3067 GetRequests, 2910 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4804 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5434, Invalid=19688, Unknown=0, NotChecked=0, Total=25122 [2018-04-11 23:02:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2018-04-11 23:02:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3288. [2018-04-11 23:02:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2018-04-11 23:02:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 3297 transitions. [2018-04-11 23:02:59,332 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 3297 transitions. Word has length 2945 [2018-04-11 23:02:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:02:59,333 INFO L459 AbstractCegarLoop]: Abstraction has 3288 states and 3297 transitions. [2018-04-11 23:02:59,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-11 23:02:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 3297 transitions. [2018-04-11 23:02:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3126 [2018-04-11 23:02:59,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:02:59,367 INFO L355 BasicCegarLoop]: trace histogram [491, 463, 463, 462, 462, 462, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:02:59,367 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__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-11 23:02:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 54435354, now seen corresponding path program 66 times [2018-04-11 23:02:59,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:02:59,367 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:02:59,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:02:59,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:02:59,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:02:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:02:59,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:03:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 671398 backedges. 205908 proven. 11861 refuted. 0 times theorem prover too weak. 453629 trivial. 0 not checked. [2018-04-11 23:03:23,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:03:23,248 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:03:23,253 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 23:03:29,849 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2018-04-11 23:03:29,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:03:29,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:03:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 671398 backedges. 151659 proven. 2324 refuted. 0 times theorem prover too weak. 517415 trivial. 0 not checked. [2018-04-11 23:03:33,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:03:33,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 60] total 118 [2018-04-11 23:03:33,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-11 23:03:33,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-11 23:03:33,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2237, Invalid=11569, Unknown=0, NotChecked=0, Total=13806 [2018-04-11 23:03:33,611 INFO L87 Difference]: Start difference. First operand 3288 states and 3297 transitions. Second operand 118 states. [2018-04-11 23:03:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:03:36,562 INFO L93 Difference]: Finished difference Result 3311 states and 3318 transitions. [2018-04-11 23:03:36,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-11 23:03:36,562 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 3125 [2018-04-11 23:03:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:03:36,566 INFO L225 Difference]: With dead ends: 3311 [2018-04-11 23:03:36,566 INFO L226 Difference]: Without dead ends: 3305 [2018-04-11 23:03:36,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3273 GetRequests, 3073 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13982 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6368, Invalid=34234, Unknown=0, NotChecked=0, Total=40602 [2018-04-11 23:03:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2018-04-11 23:03:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3288. [2018-04-11 23:03:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2018-04-11 23:03:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 3295 transitions. [2018-04-11 23:03:36,580 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 3295 transitions. Word has length 3125 [2018-04-11 23:03:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:03:36,581 INFO L459 AbstractCegarLoop]: Abstraction has 3288 states and 3295 transitions. [2018-04-11 23:03:36,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-11 23:03:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 3295 transitions. [2018-04-11 23:03:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3132 [2018-04-11 23:03:36,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:03:36,615 INFO L355 BasicCegarLoop]: trace histogram [492, 464, 464, 463, 463, 463, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:03:36,615 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__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-11 23:03:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1958968098, now seen corresponding path program 67 times [2018-04-11 23:03:36,615 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:03:36,615 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:03:36,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:03:36,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:03:36,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:03:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:03:36,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:03:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 674230 backedges. 78960 proven. 2552 refuted. 0 times theorem prover too weak. 592718 trivial. 0 not checked. [2018-04-11 23:03:54,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:03:54,519 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:03:54,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 23:03:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:03:55,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:03:55,008 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-11 23:03:55,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:03:55,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:03:55,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:04:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 674230 backedges. 78960 proven. 2552 refuted. 0 times theorem prover too weak. 592718 trivial. 0 not checked. [2018-04-11 23:04:04,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:04:04,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 64 [2018-04-11 23:04:04,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-11 23:04:04,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-11 23:04:04,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1090, Invalid=3070, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 23:04:04,920 INFO L87 Difference]: Start difference. First operand 3288 states and 3295 transitions. Second operand 65 states. [2018-04-11 23:04:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:04:07,511 INFO L93 Difference]: Finished difference Result 3314 states and 3322 transitions. [2018-04-11 23:04:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 23:04:07,512 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 3131 [2018-04-11 23:04:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:04:07,515 INFO L225 Difference]: With dead ends: 3314 [2018-04-11 23:04:07,515 INFO L226 Difference]: Without dead ends: 3314 [2018-04-11 23:04:07,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3195 GetRequests, 3044 SyntacticMatches, 58 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1734, Invalid=7196, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 23:04:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-04-11 23:04:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3294. [2018-04-11 23:04:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3294 states. [2018-04-11 23:04:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 3302 transitions. [2018-04-11 23:04:07,536 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 3302 transitions. Word has length 3131 [2018-04-11 23:04:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:04:07,538 INFO L459 AbstractCegarLoop]: Abstraction has 3294 states and 3302 transitions. [2018-04-11 23:04:07,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-11 23:04:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3302 transitions. [2018-04-11 23:04:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3138 [2018-04-11 23:04:07,576 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:04:07,576 INFO L355 BasicCegarLoop]: trace histogram [493, 465, 465, 464, 464, 464, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:04:07,576 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__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-11 23:04:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -271341206, now seen corresponding path program 68 times [2018-04-11 23:04:07,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:04:07,577 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:04:07,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:04:07,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 23:04:07,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:04:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:04:07,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:04:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 677068 backedges. 84261 proven. 2469 refuted. 0 times theorem prover too weak. 590338 trivial. 0 not checked. [2018-04-11 23:04:30,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:04:30,731 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:04:30,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 23:04:31,203 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 23:04:31,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:04:31,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:04:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 677068 backedges. 84172 proven. 2558 refuted. 0 times theorem prover too weak. 590338 trivial. 0 not checked. [2018-04-11 23:04:35,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:04:35,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 65] total 128 [2018-04-11 23:04:35,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-11 23:04:35,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-11 23:04:35,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=13330, Unknown=0, NotChecked=0, Total=16256 [2018-04-11 23:04:35,937 INFO L87 Difference]: Start difference. First operand 3294 states and 3302 transitions. Second operand 128 states. [2018-04-11 23:04:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:04:38,607 INFO L93 Difference]: Finished difference Result 3506 states and 3515 transitions. [2018-04-11 23:04:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-11 23:04:38,607 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 3137 [2018-04-11 23:04:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:04:38,611 INFO L225 Difference]: With dead ends: 3506 [2018-04-11 23:04:38,611 INFO L226 Difference]: Without dead ends: 3506 [2018-04-11 23:04:38,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3261 GetRequests, 3074 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10594 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7034, Invalid=28498, Unknown=0, NotChecked=0, Total=35532 [2018-04-11 23:04:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2018-04-11 23:04:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3486. [2018-04-11 23:04:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-04-11 23:04:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 3495 transitions. [2018-04-11 23:04:38,626 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 3495 transitions. Word has length 3137 [2018-04-11 23:04:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:04:38,627 INFO L459 AbstractCegarLoop]: Abstraction has 3486 states and 3495 transitions. [2018-04-11 23:04:38,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-11 23:04:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 3495 transitions. [2018-04-11 23:04:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3324 [2018-04-11 23:04:38,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:04:38,666 INFO L355 BasicCegarLoop]: trace histogram [523, 494, 494, 493, 493, 493, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:04:38,666 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__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-11 23:04:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash -167440109, now seen corresponding path program 69 times [2018-04-11 23:04:38,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:04:38,666 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:04:38,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:04:38,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:04:38,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:04:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:04:38,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:05:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 763309 backedges. 221804 proven. 17010 refuted. 0 times theorem prover too weak. 524495 trivial. 0 not checked. [2018-04-11 23:05:05,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:05:05,981 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:05:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 23:05:07,726 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-04-11 23:05:07,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:05:07,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:05:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 763309 backedges. 162729 proven. 7834 refuted. 0 times theorem prover too weak. 592746 trivial. 0 not checked. [2018-04-11 23:05:12,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:05:12,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 67] total 130 [2018-04-11 23:05:12,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-11 23:05:12,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-11 23:05:12,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2445, Invalid=14325, Unknown=0, NotChecked=0, Total=16770 [2018-04-11 23:05:12,438 INFO L87 Difference]: Start difference. First operand 3486 states and 3495 transitions. Second operand 130 states. [2018-04-11 23:05:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:05:17,020 INFO L93 Difference]: Finished difference Result 3511 states and 3518 transitions. [2018-04-11 23:05:17,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-11 23:05:17,020 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 3323 [2018-04-11 23:05:17,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:05:17,023 INFO L225 Difference]: With dead ends: 3511 [2018-04-11 23:05:17,024 INFO L226 Difference]: Without dead ends: 3505 [2018-04-11 23:05:17,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3516 GetRequests, 3261 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21871 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=10110, Invalid=55682, Unknown=0, NotChecked=0, Total=65792 [2018-04-11 23:05:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2018-04-11 23:05:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 3486. [2018-04-11 23:05:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-04-11 23:05:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 3493 transitions. [2018-04-11 23:05:17,041 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 3493 transitions. Word has length 3323 [2018-04-11 23:05:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:05:17,042 INFO L459 AbstractCegarLoop]: Abstraction has 3486 states and 3493 transitions. [2018-04-11 23:05:17,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-11 23:05:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 3493 transitions. [2018-04-11 23:05:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3330 [2018-04-11 23:05:17,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:05:17,097 INFO L355 BasicCegarLoop]: trace histogram [524, 495, 495, 494, 494, 494, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:05:17,097 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__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-11 23:05:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash 928153435, now seen corresponding path program 70 times [2018-04-11 23:05:17,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:05:17,098 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:05:17,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:05:17,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:05:17,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:05:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:05:17,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:05:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 766329 backedges. 87203 proven. 2730 refuted. 0 times theorem prover too weak. 676396 trivial. 0 not checked. [2018-04-11 23:05:37,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:05:37,605 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:05:37,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 23:05:38,891 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 23:05:38,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:05:38,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:05:38,928 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-11 23:05:38,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:05:38,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:05:38,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:05:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 766329 backedges. 86889 proven. 9886 refuted. 0 times theorem prover too weak. 669554 trivial. 0 not checked. [2018-04-11 23:05:50,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:05:50,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 69 [2018-04-11 23:05:50,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-11 23:05:50,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-11 23:05:50,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1168, Invalid=3662, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 23:05:50,321 INFO L87 Difference]: Start difference. First operand 3486 states and 3493 transitions. Second operand 70 states. [2018-04-11 23:05:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:05:52,493 INFO L93 Difference]: Finished difference Result 3512 states and 3520 transitions. [2018-04-11 23:05:52,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 23:05:52,494 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 3329 [2018-04-11 23:05:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:05:52,498 INFO L225 Difference]: With dead ends: 3512 [2018-04-11 23:05:52,498 INFO L226 Difference]: Without dead ends: 3512 [2018-04-11 23:05:52,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3395 GetRequests, 3237 SyntacticMatches, 59 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3156 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1881, Invalid=8219, Unknown=0, NotChecked=0, Total=10100 [2018-04-11 23:05:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2018-04-11 23:05:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3492. [2018-04-11 23:05:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3492 states. [2018-04-11 23:05:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 3500 transitions. [2018-04-11 23:05:52,513 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 3500 transitions. Word has length 3329 [2018-04-11 23:05:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:05:52,514 INFO L459 AbstractCegarLoop]: Abstraction has 3492 states and 3500 transitions. [2018-04-11 23:05:52,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-11 23:05:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 3500 transitions. [2018-04-11 23:05:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3336 [2018-04-11 23:05:52,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:05:52,554 INFO L355 BasicCegarLoop]: trace histogram [525, 496, 496, 495, 495, 495, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:05:52,554 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__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-11 23:05:52,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1420632349, now seen corresponding path program 71 times [2018-04-11 23:05:52,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 23:05:52,554 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 23:05:52,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:05:52,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 23:05:52,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 23:05:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:05:52,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 23:06:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 769355 backedges. 92867 proven. 2644 refuted. 0 times theorem prover too weak. 673844 trivial. 0 not checked. [2018-04-11 23:06:19,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 23:06:19,281 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 23:06:19,287 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 23:06:30,908 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 75 check-sat command(s) [2018-04-11 23:06:30,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 23:06:30,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-04-11 23:06:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 769355 backedges. 92731 proven. 15134 refuted. 0 times theorem prover too weak. 661490 trivial. 0 not checked. [2018-04-11 23:06:35,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:06:35,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 70] total 104 [2018-04-11 23:06:35,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-11 23:06:35,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-11 23:06:35,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2203, Invalid=8509, Unknown=0, NotChecked=0, Total=10712 [2018-04-11 23:06:35,196 INFO L87 Difference]: Start difference. First operand 3492 states and 3500 transitions. Second operand 104 states. [2018-04-11 23:06:35,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 23:06:35,197 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 23:06:35,200 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 23:06:35,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:06:35 BoogieIcfgContainer [2018-04-11 23:06:35,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 23:06:35,201 INFO L168 Benchmark]: Toolchain (without parser) took 800159.86 ms. Allocated memory was 317.2 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 264.3 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-04-11 23:06:35,202 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 317.2 MB. Free memory is still 286.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 23:06:35,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.86 ms. Allocated memory is still 317.2 MB. Free memory was 264.3 MB in the beginning and 252.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:06:35,203 INFO L168 Benchmark]: Boogie Preprocessor took 25.48 ms. Allocated memory is still 317.2 MB. Free memory was 252.3 MB in the beginning and 251.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 23:06:35,203 INFO L168 Benchmark]: RCFGBuilder took 280.13 ms. Allocated memory was 317.2 MB in the beginning and 401.1 MB in the end (delta: 83.9 MB). Free memory was 251.0 MB in the beginning and 365.6 MB in the end (delta: -114.6 MB). Peak memory consumption was 34.7 MB. Max. memory is 5.3 GB. [2018-04-11 23:06:35,203 INFO L168 Benchmark]: TraceAbstraction took 799700.53 ms. Allocated memory was 401.1 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 364.2 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-04-11 23:06:35,204 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.13 ms. Allocated memory is still 317.2 MB. Free memory is still 286.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.86 ms. Allocated memory is still 317.2 MB. Free memory was 264.3 MB in the beginning and 252.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.48 ms. Allocated memory is still 317.2 MB. Free memory was 252.3 MB in the beginning and 251.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 280.13 ms. Allocated memory was 317.2 MB in the beginning and 401.1 MB in the end (delta: 83.9 MB). Free memory was 251.0 MB in the beginning and 365.6 MB in the end (delta: -114.6 MB). Peak memory consumption was 34.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 799700.53 ms. Allocated memory was 401.1 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 364.2 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 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 (3492states) and interpolant automaton (currently 2 states, 104 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 (3492states) and interpolant automaton (currently 2 states, 104 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 (3492states) and interpolant automaton (currently 2 states, 104 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 (3492states) and interpolant automaton (currently 2 states, 104 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 (3492states) and interpolant automaton (currently 2 states, 104 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 (3492states) and interpolant automaton (currently 2 states, 104 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, 799.6s OverallTime, 79 OverallIterations, 525 TraceHistogramMax, 107.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3811 SDtfs, 45071 SDslu, 51721 SDs, 0 SdLazy, 186486 SolverSat, 5617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109167 GetRequests, 101324 SyntacticMatches, 866 SemanticMatches, 6977 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 281022 ImplicationChecksByTransitivity, 114.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3492occurred in iteration=78, 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.6s AutomataMinimizationTime, 78 MinimizatonAttempts, 1343 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.3s SsaConstructionTime, 66.2s SatisfiabilityAnalysisTime, 555.2s InterpolantComputationTime, 207836 NumberOfCodeBlocks, 194328 NumberOfCodeBlocksAsserted, 1221 NumberOfCheckSat, 207683 ConstructedInterpolants, 30104 QuantifiedInterpolants, 1127146500 SizeOfPredicates, 276 NumberOfNonLiveVariables, 203781 ConjunctsInSsa, 2974 ConjunctsInUnsatCore, 153 InterpolantComputations, 6 PerfectInterpolantSequences, 29362716/29779467 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_23-06-35-208.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_23-06-35-208.csv Completed graceful shutdown