java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:56:34,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:56:34,897 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:56:34,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:56:34,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:56:34,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:56:34,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:56:34,914 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:56:34,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:56:34,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:56:34,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:56:34,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:56:34,919 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:56:34,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:56:34,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:56:34,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:56:34,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:56:34,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:56:34,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:56:34,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:56:34,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:56:34,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:56:34,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:56:34,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:56:34,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:56:34,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:56:34,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:56:34,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:56:34,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:56:34,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:56:34,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:56:34,936 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-10 14:56:34,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:56:34,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:56:34,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:56:34,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:56:34,950 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:56:34,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:56:34,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:56:34,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:56:34,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:56:34,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:56:34,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:56:34,951 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:56:34,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:56:34,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:56:34,952 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-04-10 14:56:34,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:56:34,993 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:56:34,998 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:56:35,001 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:56:35,002 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:56:35,002 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-write.c [2018-04-10 14:56:35,318 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe5a983288 [2018-04-10 14:56:35,457 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:56:35,457 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:56:35,458 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 14:56:35,459 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:56:35,459 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:56:35,459 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:56:35,459 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo ('foo') in ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 14:56:35,459 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 14:56:35,459 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:56:35,460 INFO L233 ultiparseSymbolTable]: [2018-04-10 14:56:35,471 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe5a983288 [2018-04-10 14:56:35,474 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:56:35,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:56:35,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:56:35,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:56:35,480 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:56:35,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c0fa73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35, skipping insertion in model container [2018-04-10 14:56:35,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,493 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:56:35,500 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:56:35,597 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:56:35,615 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:56:35,619 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 14:56:35,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35 WrapperNode [2018-04-10 14:56:35,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:56:35,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:56:35,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:56:35,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:56:35,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... [2018-04-10 14:56:35,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:56:35,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:56:35,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:56:35,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:56:35,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:56:35,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:56:35,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:56:35,689 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-10 14:56:35,689 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:56:35,689 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-10 14:56:35,689 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:56:35,689 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:56:35,689 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:56:35,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:56:35,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:56:35,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:56:35,690 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:56:35,690 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:56:35,901 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:56:35,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:56:35 BoogieIcfgContainer [2018-04-10 14:56:35,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:56:35,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:56:35,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:56:35,906 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:56:35,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:56:35" (1/3) ... [2018-04-10 14:56:35,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b76a234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:56:35, skipping insertion in model container [2018-04-10 14:56:35,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:56:35" (2/3) ... [2018-04-10 14:56:35,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b76a234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:56:35, skipping insertion in model container [2018-04-10 14:56:35,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:56:35" (3/3) ... [2018-04-10 14:56:35,909 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 14:56:35,917 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:56:35,928 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 14:56:35,966 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:56:35,967 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:56:35,967 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:56:35,967 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-10 14:56:35,967 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-10 14:56:35,967 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:56:35,967 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:56:35,967 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:56:35,967 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:56:35,968 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:56:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-10 14:56:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-10 14:56:35,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:35,985 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:35,986 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash -895474378, now seen corresponding path program 1 times [2018-04-10 14:56:36,032 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:36,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:56:36,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 14:56:36,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,132 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-04-10 14:56:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:56:36,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:56:36,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:56:36,144 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-10 14:56:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:36,193 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-10 14:56:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:56:36,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-10 14:56:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:36,201 INFO L225 Difference]: With dead ends: 63 [2018-04-10 14:56:36,201 INFO L226 Difference]: Without dead ends: 59 [2018-04-10 14:56:36,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:56:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-10 14:56:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-10 14:56:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 14:56:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-10 14:56:36,227 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-10 14:56:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:36,227 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-10 14:56:36,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:56:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-10 14:56:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 14:56:36,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:36,228 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:36,228 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:36,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1597342241, now seen corresponding path program 1 times [2018-04-10 14:56:36,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:36,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:56:36,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 14:56:36,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,258 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)] [2018-04-10 14:56:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:56:36,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:56:36,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:56:36,261 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-10 14:56:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:36,288 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-10 14:56:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:56:36,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-10 14:56:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:36,290 INFO L225 Difference]: With dead ends: 60 [2018-04-10 14:56:36,291 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 14:56:36,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:56:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 14:56:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-10 14:56:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-10 14:56:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-10 14:56:36,295 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-10 14:56:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:36,295 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-10 14:56:36,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:56:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-10 14:56:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 14:56:36,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:36,296 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:36,296 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997981, now seen corresponding path program 1 times [2018-04-10 14:56:36,297 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:36,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:56:36,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:56:36,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,401 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(= 1 (select |#valid| |main_~#mask~0.base|)), 282#(= 1 (select |#valid| |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~b.base|)), 283#(= 1 (select |#valid| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.base))] [2018-04-10 14:56:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:56:36,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:56:36,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:56:36,402 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-04-10 14:56:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:36,488 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-04-10 14:56:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:56:36,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 14:56:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:36,490 INFO L225 Difference]: With dead ends: 51 [2018-04-10 14:56:36,490 INFO L226 Difference]: Without dead ends: 51 [2018-04-10 14:56:36,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:56:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-10 14:56:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-10 14:56:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-10 14:56:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-10 14:56:36,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-04-10 14:56:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:36,496 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-10 14:56:36,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:56:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-10 14:56:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 14:56:36,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:36,497 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:36,498 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997980, now seen corresponding path program 1 times [2018-04-10 14:56:36,499 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:36,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:56:36,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:56:36,591 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,592 INFO L182 omatonBuilderFactory]: Interpolants [388#true, 389#false, 390#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 391#(and (= 32 (select |#length| |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~b.base|)) (= 0 |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~b.offset|)), 392#(and (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.offset 0) (= 32 (select |#length| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.base))), 393#(and (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.offset 0) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 31) (= 32 (select |#length| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.base)))] [2018-04-10 14:56:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:56:36,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:56:36,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:56:36,593 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-04-10 14:56:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:36,671 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-04-10 14:56:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:56:36,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-10 14:56:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:36,672 INFO L225 Difference]: With dead ends: 53 [2018-04-10 14:56:36,673 INFO L226 Difference]: Without dead ends: 53 [2018-04-10 14:56:36,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:56:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-10 14:56:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-10 14:56:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 14:56:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-10 14:56:36,677 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-04-10 14:56:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:36,677 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-10 14:56:36,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:56:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-10 14:56:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:56:36,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:36,678 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:36,678 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash -869005287, now seen corresponding path program 1 times [2018-04-10 14:56:36,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:36,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:36,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-10 14:56:36,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,722 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 504#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1))] [2018-04-10 14:56:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:56:36,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:56:36,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:56:36,723 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-04-10 14:56:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:36,752 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-10 14:56:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:56:36,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-10 14:56:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:36,753 INFO L225 Difference]: With dead ends: 65 [2018-04-10 14:56:36,753 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 14:56:36,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:56:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 14:56:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-04-10 14:56:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-10 14:56:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-04-10 14:56:36,757 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-04-10 14:56:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:36,757 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-04-10 14:56:36,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:56:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-04-10 14:56:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 14:56:36,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:36,757 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] [2018-04-10 14:56:36,757 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash -994035242, now seen corresponding path program 1 times [2018-04-10 14:56:36,758 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:36,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:56:36,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:56:36,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,790 INFO L182 omatonBuilderFactory]: Interpolants [626#true, 627#false, 628#(<= 0 main_~i~1), 629#(<= 1 main_~i~1), 630#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-04-10 14:56:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:56:36,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:56:36,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:56:36,790 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-04-10 14:56:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:36,815 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-04-10 14:56:36,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:56:36,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-10 14:56:36,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:36,815 INFO L225 Difference]: With dead ends: 66 [2018-04-10 14:56:36,815 INFO L226 Difference]: Without dead ends: 66 [2018-04-10 14:56:36,816 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:56:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-10 14:56:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-04-10 14:56:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-10 14:56:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-10 14:56:36,818 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-04-10 14:56:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:36,818 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-10 14:56:36,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:56:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-10 14:56:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 14:56:36,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:36,819 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:36,819 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash -561761263, now seen corresponding path program 2 times [2018-04-10 14:56:36,820 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:36,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:36,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 14:56:36,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,890 INFO L182 omatonBuilderFactory]: Interpolants [752#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1), 753#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1), 754#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 755#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 756#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 749#true, 750#false, 751#(= main_~i~1 0)] [2018-04-10 14:56:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:36,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:56:36,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:56:36,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:56:36,892 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 8 states. [2018-04-10 14:56:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:37,008 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-04-10 14:56:37,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:56:37,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-10 14:56:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:37,009 INFO L225 Difference]: With dead ends: 82 [2018-04-10 14:56:37,010 INFO L226 Difference]: Without dead ends: 82 [2018-04-10 14:56:37,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:56:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-10 14:56:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-04-10 14:56:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-10 14:56:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-04-10 14:56:37,015 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-04-10 14:56:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:37,015 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-04-10 14:56:37,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:56:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-04-10 14:56:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:56:37,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:37,016 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 14:56:37,016 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:37,017 INFO L82 PathProgramCache]: Analyzing trace with hash 701046357, now seen corresponding path program 1 times [2018-04-10 14:56:37,017 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:37,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:37,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-10 14:56:37,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,050 INFO L182 omatonBuilderFactory]: Interpolants [917#true, 918#false, 919#(= main_~i~1 0), 920#(<= main_~i~1 1)] [2018-04-10 14:56:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:56:37,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:56:37,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:56:37,051 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 4 states. [2018-04-10 14:56:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:37,107 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-04-10 14:56:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:56:37,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-10 14:56:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:37,108 INFO L225 Difference]: With dead ends: 98 [2018-04-10 14:56:37,108 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 14:56:37,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:56:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 14:56:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-04-10 14:56:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 14:56:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-04-10 14:56:37,114 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-04-10 14:56:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:37,114 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-04-10 14:56:37,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:56:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-04-10 14:56:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 14:56:37,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:37,116 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:37,116 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1455688847, now seen corresponding path program 1 times [2018-04-10 14:56:37,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:37,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 14:56:37,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:56:37,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:56:37,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,174 INFO L182 omatonBuilderFactory]: Interpolants [1104#(and (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0) (<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 1105#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1) 0), 1100#true, 1101#false, 1102#(<= 0 main_~i~1), 1103#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0))] [2018-04-10 14:56:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 14:56:37,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:56:37,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:56:37,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:56:37,175 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-04-10 14:56:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:37,222 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-04-10 14:56:37,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:56:37,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-10 14:56:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:37,223 INFO L225 Difference]: With dead ends: 87 [2018-04-10 14:56:37,223 INFO L226 Difference]: Without dead ends: 81 [2018-04-10 14:56:37,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:56:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-10 14:56:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-10 14:56:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 14:56:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-04-10 14:56:37,229 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-04-10 14:56:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:37,230 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-04-10 14:56:37,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:56:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-04-10 14:56:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:56:37,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:37,231 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:37,231 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1559883415, now seen corresponding path program 2 times [2018-04-10 14:56:37,232 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:37,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 14:56:37,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:37,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 14:56:37,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,292 INFO L182 omatonBuilderFactory]: Interpolants [1280#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 1281#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 0), 1276#true, 1277#false, 1278#(<= 0 main_~i~1), 1279#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0))] [2018-04-10 14:56:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 14:56:37,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:56:37,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:56:37,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:56:37,293 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-04-10 14:56:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:37,356 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-04-10 14:56:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:56:37,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-04-10 14:56:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:37,357 INFO L225 Difference]: With dead ends: 90 [2018-04-10 14:56:37,357 INFO L226 Difference]: Without dead ends: 84 [2018-04-10 14:56:37,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:56:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-10 14:56:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-04-10 14:56:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 14:56:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-04-10 14:56:37,360 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-04-10 14:56:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:37,360 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-04-10 14:56:37,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:56:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-04-10 14:56:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 14:56:37,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:37,361 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:37,361 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -250620575, now seen corresponding path program 3 times [2018-04-10 14:56:37,362 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:37,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 14:56:37,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:37,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-10 14:56:37,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,485 INFO L182 omatonBuilderFactory]: Interpolants [1456#false, 1457#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 1458#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 1459#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 1455#true] [2018-04-10 14:56:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 14:56:37,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:56:37,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:56:37,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:56:37,486 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-04-10 14:56:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:37,525 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-04-10 14:56:37,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:56:37,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-04-10 14:56:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:37,527 INFO L225 Difference]: With dead ends: 93 [2018-04-10 14:56:37,527 INFO L226 Difference]: Without dead ends: 93 [2018-04-10 14:56:37,527 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:56:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-10 14:56:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-04-10 14:56:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-10 14:56:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-10 14:56:37,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 52 [2018-04-10 14:56:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:37,531 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-10 14:56:37,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:56:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-10 14:56:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:56:37,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:37,532 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:37,532 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -246224039, now seen corresponding path program 4 times [2018-04-10 14:56:37,533 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:37,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 14:56:37,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:37,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:56:37,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,632 INFO L182 omatonBuilderFactory]: Interpolants [1648#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 1649#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 1640#true, 1641#false, 1642#(= main_~i~1 0), 1643#(<= main_~i~1 1), 1644#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 2), 1645#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2), 1646#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 1647#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1))] [2018-04-10 14:56:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 14:56:37,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:56:37,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:56:37,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:56:37,633 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-04-10 14:56:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:37,755 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-04-10 14:56:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:56:37,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-04-10 14:56:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:37,757 INFO L225 Difference]: With dead ends: 128 [2018-04-10 14:56:37,757 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 14:56:37,757 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:56:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 14:56:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-04-10 14:56:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-10 14:56:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-04-10 14:56:37,760 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 58 [2018-04-10 14:56:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:37,761 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-04-10 14:56:37,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:56:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-04-10 14:56:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 14:56:37,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:37,762 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-10 14:56:37,762 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash 404087573, now seen corresponding path program 1 times [2018-04-10 14:56:37,763 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:37,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-10 14:56:37,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:37,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 14:56:37,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:37,831 INFO L182 omatonBuilderFactory]: Interpolants [1904#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 31), 1905#(<= main_~i~1 30), 1906#(<= main_~i~1 31), 1899#true, 1900#false, 1901#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size), 1902#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 31)), 1903#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 32))] [2018-04-10 14:56:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-10 14:56:37,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:56:37,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:56:37,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:56:37,832 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-04-10 14:56:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:37,925 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-04-10 14:56:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:56:37,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-04-10 14:56:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:37,927 INFO L225 Difference]: With dead ends: 92 [2018-04-10 14:56:37,927 INFO L226 Difference]: Without dead ends: 92 [2018-04-10 14:56:37,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:56:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-10 14:56:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-04-10 14:56:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-10 14:56:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-04-10 14:56:37,930 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 67 [2018-04-10 14:56:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:37,931 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-04-10 14:56:37,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:56:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-04-10 14:56:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 14:56:37,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:37,932 INFO L355 BasicCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:37,932 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash 760045737, now seen corresponding path program 5 times [2018-04-10 14:56:37,933 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:37,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-10 14:56:38,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:38,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 14:56:38,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:38,011 INFO L182 omatonBuilderFactory]: Interpolants [2100#true, 2101#false, 2102#(<= 0 main_~i~1), 2103#(<= 1 main_~i~1), 2104#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 2105#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 2106#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 2107#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1)] [2018-04-10 14:56:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-10 14:56:38,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:56:38,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:56:38,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:56:38,012 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 8 states. [2018-04-10 14:56:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:38,059 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-04-10 14:56:38,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:56:38,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-04-10 14:56:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:38,059 INFO L225 Difference]: With dead ends: 101 [2018-04-10 14:56:38,060 INFO L226 Difference]: Without dead ends: 95 [2018-04-10 14:56:38,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:56:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-10 14:56:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-04-10 14:56:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-10 14:56:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-04-10 14:56:38,061 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 82 [2018-04-10 14:56:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:38,062 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-04-10 14:56:38,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:56:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-04-10 14:56:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 14:56:38,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:38,062 INFO L355 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:38,062 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash -264260447, now seen corresponding path program 6 times [2018-04-10 14:56:38,063 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:38,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-04-10 14:56:38,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:38,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 14:56:38,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:38,149 INFO L182 omatonBuilderFactory]: Interpolants [2304#false, 2305#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 2306#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 2307#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 2308#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 2309#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 2303#true] [2018-04-10 14:56:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-04-10 14:56:38,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:56:38,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:56:38,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:56:38,150 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 7 states. [2018-04-10 14:56:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:38,197 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-04-10 14:56:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:56:38,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-04-10 14:56:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:38,199 INFO L225 Difference]: With dead ends: 104 [2018-04-10 14:56:38,199 INFO L226 Difference]: Without dead ends: 104 [2018-04-10 14:56:38,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:56:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-10 14:56:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-04-10 14:56:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-10 14:56:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-04-10 14:56:38,202 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 88 [2018-04-10 14:56:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:38,203 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-04-10 14:56:38,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:56:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-04-10 14:56:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-10 14:56:38,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:38,204 INFO L355 BasicCegarLoop]: trace histogram [12, 10, 9, 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-10 14:56:38,204 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1483627161, now seen corresponding path program 7 times [2018-04-10 14:56:38,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:38,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-04-10 14:56:38,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:38,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:56:38,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:38,299 INFO L182 omatonBuilderFactory]: Interpolants [2516#true, 2517#false, 2518#(= main_~i~1 0), 2519#(<= main_~i~1 1), 2520#(<= main_~i~1 2), 2521#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 3), 2522#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3), 2523#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 2524#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 2525#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 2526#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 2527#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:56:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-04-10 14:56:38,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:56:38,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:56:38,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:56:38,300 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 12 states. [2018-04-10 14:56:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:38,451 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-04-10 14:56:38,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:56:38,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-04-10 14:56:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:38,452 INFO L225 Difference]: With dead ends: 136 [2018-04-10 14:56:38,452 INFO L226 Difference]: Without dead ends: 136 [2018-04-10 14:56:38,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:56:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-10 14:56:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-04-10 14:56:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:56:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-04-10 14:56:38,456 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 94 [2018-04-10 14:56:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:38,456 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-04-10 14:56:38,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:56:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-04-10 14:56:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-10 14:56:38,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:38,457 INFO L355 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:38,457 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:38,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1650581535, now seen corresponding path program 8 times [2018-04-10 14:56:38,458 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:38,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-10 14:56:38,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:38,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:56:38,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:38,582 INFO L182 omatonBuilderFactory]: Interpolants [2816#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 2817#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 2), 2808#true, 2809#false, 2810#(<= 0 main_~i~1), 2811#(<= 1 main_~i~1), 2812#(<= 2 main_~i~1), 2813#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 2814#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 2815#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2))] [2018-04-10 14:56:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-10 14:56:38,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:56:38,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:56:38,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:56:38,584 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 10 states. [2018-04-10 14:56:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:38,657 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-04-10 14:56:38,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:56:38,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-04-10 14:56:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:38,658 INFO L225 Difference]: With dead ends: 143 [2018-04-10 14:56:38,658 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 14:56:38,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:56:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 14:56:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-04-10 14:56:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:56:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-04-10 14:56:38,662 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 124 [2018-04-10 14:56:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:38,662 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-04-10 14:56:38,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:56:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-04-10 14:56:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-10 14:56:38,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:38,664 INFO L355 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:38,664 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:38,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1018374617, now seen corresponding path program 9 times [2018-04-10 14:56:38,665 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:38,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-04-10 14:56:38,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:38,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 14:56:38,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:38,746 INFO L182 omatonBuilderFactory]: Interpolants [3104#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 3105#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 3099#true, 3100#false, 3101#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 3102#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 3103#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2))] [2018-04-10 14:56:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-04-10 14:56:38,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:56:38,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:56:38,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:56:38,747 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 7 states. [2018-04-10 14:56:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:38,805 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-04-10 14:56:38,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:56:38,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-04-10 14:56:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:38,806 INFO L225 Difference]: With dead ends: 146 [2018-04-10 14:56:38,806 INFO L226 Difference]: Without dead ends: 146 [2018-04-10 14:56:38,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:56:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-10 14:56:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-04-10 14:56:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-10 14:56:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-04-10 14:56:38,810 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 130 [2018-04-10 14:56:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:38,811 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-04-10 14:56:38,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:56:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-04-10 14:56:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-04-10 14:56:38,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:38,812 INFO L355 BasicCegarLoop]: trace histogram [18, 15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:38,812 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash 236127697, now seen corresponding path program 10 times [2018-04-10 14:56:38,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:38,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-10 14:56:38,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:38,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 14:56:38,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:38,966 INFO L182 omatonBuilderFactory]: Interpolants [3392#true, 3393#false, 3394#(= main_~i~1 0), 3395#(<= main_~i~1 1), 3396#(<= main_~i~1 2), 3397#(<= main_~i~1 3), 3398#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 4), 3399#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4), 3400#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 3401#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 3402#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 3403#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 3404#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 3405#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:56:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-10 14:56:38,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:56:38,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:56:38,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:56:38,967 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 14 states. [2018-04-10 14:56:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:39,192 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-04-10 14:56:39,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:56:39,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-04-10 14:56:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:39,193 INFO L225 Difference]: With dead ends: 184 [2018-04-10 14:56:39,193 INFO L226 Difference]: Without dead ends: 184 [2018-04-10 14:56:39,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:56:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-10 14:56:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-04-10 14:56:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 14:56:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-04-10 14:56:39,198 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 136 [2018-04-10 14:56:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:39,198 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-04-10 14:56:39,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:56:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-04-10 14:56:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 14:56:39,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:39,199 INFO L355 BasicCegarLoop]: trace histogram [23, 19, 18, 18, 18, 18, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:39,199 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1774140143, now seen corresponding path program 11 times [2018-04-10 14:56:39,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:39,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-04-10 14:56:39,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:39,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:56:39,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:39,368 INFO L182 omatonBuilderFactory]: Interpolants [3792#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 3793#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 3794#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 3795#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 3), 3784#true, 3785#false, 3786#(<= 0 main_~i~1), 3787#(<= 1 main_~i~1), 3788#(<= 2 main_~i~1), 3789#(<= 3 main_~i~1), 3790#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 3791#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1))] [2018-04-10 14:56:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-04-10 14:56:39,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:56:39,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:56:39,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:56:39,369 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand 12 states. [2018-04-10 14:56:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:39,528 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-04-10 14:56:39,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:56:39,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-04-10 14:56:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:39,529 INFO L225 Difference]: With dead ends: 191 [2018-04-10 14:56:39,529 INFO L226 Difference]: Without dead ends: 185 [2018-04-10 14:56:39,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:56:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-10 14:56:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-04-10 14:56:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 14:56:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-04-10 14:56:39,534 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 172 [2018-04-10 14:56:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:39,534 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-04-10 14:56:39,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:56:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-04-10 14:56:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-10 14:56:39,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:39,535 INFO L355 BasicCegarLoop]: trace histogram [24, 20, 19, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:39,536 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:39,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1375873801, now seen corresponding path program 12 times [2018-04-10 14:56:39,536 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:39,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-10 14:56:39,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:39,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 14:56:39,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:39,670 INFO L182 omatonBuilderFactory]: Interpolants [4176#false, 4177#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 4178#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 4179#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 4180#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 4181#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 4182#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 4183#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 4175#true] [2018-04-10 14:56:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-10 14:56:39,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:56:39,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:56:39,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:56:39,672 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 9 states. [2018-04-10 14:56:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:39,778 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-04-10 14:56:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:56:39,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2018-04-10 14:56:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:39,780 INFO L225 Difference]: With dead ends: 194 [2018-04-10 14:56:39,780 INFO L226 Difference]: Without dead ends: 194 [2018-04-10 14:56:39,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:56:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-10 14:56:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-04-10 14:56:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-10 14:56:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-04-10 14:56:39,784 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 178 [2018-04-10 14:56:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:39,785 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-04-10 14:56:39,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:56:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-04-10 14:56:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-10 14:56:39,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:39,786 INFO L355 BasicCegarLoop]: trace histogram [25, 21, 20, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:39,786 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2106090241, now seen corresponding path program 13 times [2018-04-10 14:56:39,787 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:39,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-04-10 14:56:39,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:39,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 14:56:39,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:39,977 INFO L182 omatonBuilderFactory]: Interpolants [4576#(= main_~i~1 0), 4577#(<= main_~i~1 1), 4578#(<= main_~i~1 2), 4579#(<= main_~i~1 3), 4580#(<= main_~i~1 4), 4581#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 5), 4582#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5), 4583#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 4584#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 4585#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 4586#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 4587#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 4588#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 4589#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 4574#true, 4575#false] [2018-04-10 14:56:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-04-10 14:56:39,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:56:39,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:56:39,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:56:39,979 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 16 states. [2018-04-10 14:56:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:40,176 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-04-10 14:56:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:56:40,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2018-04-10 14:56:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:40,179 INFO L225 Difference]: With dead ends: 238 [2018-04-10 14:56:40,179 INFO L226 Difference]: Without dead ends: 238 [2018-04-10 14:56:40,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:56:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-10 14:56:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-04-10 14:56:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 14:56:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 239 transitions. [2018-04-10 14:56:40,184 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 239 transitions. Word has length 184 [2018-04-10 14:56:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:40,184 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 239 transitions. [2018-04-10 14:56:40,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:56:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 239 transitions. [2018-04-10 14:56:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-04-10 14:56:40,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:40,185 INFO L355 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:40,185 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1356019769, now seen corresponding path program 14 times [2018-04-10 14:56:40,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:40,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-04-10 14:56:40,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:40,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 14:56:40,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:40,384 INFO L182 omatonBuilderFactory]: Interpolants [5088#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 5089#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 5090#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 5091#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 4), 5078#true, 5079#false, 5080#(<= 0 main_~i~1), 5081#(<= 1 main_~i~1), 5082#(<= 2 main_~i~1), 5083#(<= 3 main_~i~1), 5084#(<= 4 main_~i~1), 5085#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 5086#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 5087#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2))] [2018-04-10 14:56:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-04-10 14:56:40,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:56:40,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:56:40,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:56:40,386 INFO L87 Difference]: Start difference. First operand 236 states and 239 transitions. Second operand 14 states. [2018-04-10 14:56:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:40,556 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-04-10 14:56:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 14:56:40,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-04-10 14:56:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:40,558 INFO L225 Difference]: With dead ends: 245 [2018-04-10 14:56:40,558 INFO L226 Difference]: Without dead ends: 239 [2018-04-10 14:56:40,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:56:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-10 14:56:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-04-10 14:56:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 14:56:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-04-10 14:56:40,564 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 226 [2018-04-10 14:56:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:40,564 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-04-10 14:56:40,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:56:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-04-10 14:56:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 14:56:40,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:40,566 INFO L355 BasicCegarLoop]: trace histogram [32, 27, 26, 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-10 14:56:40,566 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash 901554225, now seen corresponding path program 15 times [2018-04-10 14:56:40,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:40,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-10 14:56:40,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:40,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 14:56:40,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:40,747 INFO L182 omatonBuilderFactory]: Interpolants [5584#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 5585#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 5586#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 5587#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 5588#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 5589#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 5590#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 5581#true, 5582#false, 5583#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)] [2018-04-10 14:56:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-10 14:56:40,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:56:40,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:56:40,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:56:40,748 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 10 states. [2018-04-10 14:56:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:40,837 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-04-10 14:56:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:56:40,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 232 [2018-04-10 14:56:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:40,838 INFO L225 Difference]: With dead ends: 248 [2018-04-10 14:56:40,838 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 14:56:40,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:56:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 14:56:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2018-04-10 14:56:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 14:56:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2018-04-10 14:56:40,842 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 232 [2018-04-10 14:56:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:40,843 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2018-04-10 14:56:40,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:56:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2018-04-10 14:56:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-10 14:56:40,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:40,844 INFO L355 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:40,844 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:40,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1429186007, now seen corresponding path program 16 times [2018-04-10 14:56:40,845 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:40,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-04-10 14:56:41,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:41,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 14:56:41,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:41,048 INFO L182 omatonBuilderFactory]: Interpolants [6091#true, 6092#false, 6093#(= main_~i~1 0), 6094#(<= main_~i~1 1), 6095#(<= main_~i~1 2), 6096#(<= main_~i~1 3), 6097#(<= main_~i~1 4), 6098#(<= main_~i~1 5), 6099#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 6), 6100#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6), 6101#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 6102#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 6103#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 6104#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 6105#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 6106#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 6107#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 6108#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:56:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-04-10 14:56:41,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:56:41,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:56:41,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:56:41,049 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 18 states. [2018-04-10 14:56:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:41,293 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-04-10 14:56:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 14:56:41,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 238 [2018-04-10 14:56:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:41,295 INFO L225 Difference]: With dead ends: 298 [2018-04-10 14:56:41,295 INFO L226 Difference]: Without dead ends: 298 [2018-04-10 14:56:41,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:56:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-10 14:56:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-04-10 14:56:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-10 14:56:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2018-04-10 14:56:41,302 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 238 [2018-04-10 14:56:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:41,302 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2018-04-10 14:56:41,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:56:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2018-04-10 14:56:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-04-10 14:56:41,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:41,304 INFO L355 BasicCegarLoop]: trace histogram [40, 34, 33, 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-10 14:56:41,304 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1943743655, now seen corresponding path program 17 times [2018-04-10 14:56:41,305 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:41,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-04-10 14:56:41,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:41,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 14:56:41,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:41,546 INFO L182 omatonBuilderFactory]: Interpolants [6720#false, 6721#(<= 0 main_~i~1), 6722#(<= 1 main_~i~1), 6723#(<= 2 main_~i~1), 6724#(<= 3 main_~i~1), 6725#(<= 4 main_~i~1), 6726#(<= 5 main_~i~1), 6727#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 6728#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 6729#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 6730#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 6731#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 6732#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 6733#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 6734#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 5), 6719#true] [2018-04-10 14:56:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-04-10 14:56:41,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:56:41,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:56:41,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:56:41,548 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 16 states. [2018-04-10 14:56:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:41,758 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-04-10 14:56:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:56:41,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 286 [2018-04-10 14:56:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:41,759 INFO L225 Difference]: With dead ends: 305 [2018-04-10 14:56:41,759 INFO L226 Difference]: Without dead ends: 299 [2018-04-10 14:56:41,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:56:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-10 14:56:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-04-10 14:56:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-10 14:56:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2018-04-10 14:56:41,774 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 286 [2018-04-10 14:56:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:41,774 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2018-04-10 14:56:41,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:56:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2018-04-10 14:56:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-10 14:56:41,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:41,776 INFO L355 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:41,776 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:41,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1874435247, now seen corresponding path program 18 times [2018-04-10 14:56:41,776 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:41,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-04-10 14:56:42,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:42,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:56:42,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:42,012 INFO L182 omatonBuilderFactory]: Interpolants [7346#true, 7347#false, 7348#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 7349#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 7350#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 7351#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 7352#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 7353#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 7354#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 7355#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 7356#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7))] [2018-04-10 14:56:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-04-10 14:56:42,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:56:42,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:56:42,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:56:42,014 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 11 states. [2018-04-10 14:56:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:42,166 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2018-04-10 14:56:42,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:56:42,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 292 [2018-04-10 14:56:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:42,168 INFO L225 Difference]: With dead ends: 308 [2018-04-10 14:56:42,168 INFO L226 Difference]: Without dead ends: 308 [2018-04-10 14:56:42,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:56:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-10 14:56:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2018-04-10 14:56:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-10 14:56:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 304 transitions. [2018-04-10 14:56:42,174 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 304 transitions. Word has length 292 [2018-04-10 14:56:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:42,175 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 304 transitions. [2018-04-10 14:56:42,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:56:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 304 transitions. [2018-04-10 14:56:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-04-10 14:56:42,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:42,176 INFO L355 BasicCegarLoop]: trace histogram [42, 36, 35, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:42,177 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 914572617, now seen corresponding path program 19 times [2018-04-10 14:56:42,177 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:42,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-10 14:56:42,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:42,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 14:56:42,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:42,542 INFO L182 omatonBuilderFactory]: Interpolants [7979#true, 7980#false, 7981#(= main_~i~1 0), 7982#(<= main_~i~1 1), 7983#(<= main_~i~1 2), 7984#(<= main_~i~1 3), 7985#(<= main_~i~1 4), 7986#(<= main_~i~1 5), 7987#(<= main_~i~1 6), 7988#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 7), 7989#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7), 7990#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 7991#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 7992#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 7993#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 7994#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 7995#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 7996#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 7997#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 7998#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:56:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-10 14:56:42,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:56:42,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:56:42,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:56:42,545 INFO L87 Difference]: Start difference. First operand 302 states and 304 transitions. Second operand 20 states. [2018-04-10 14:56:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:42,938 INFO L93 Difference]: Finished difference Result 364 states and 367 transitions. [2018-04-10 14:56:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:56:42,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 298 [2018-04-10 14:56:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:42,940 INFO L225 Difference]: With dead ends: 364 [2018-04-10 14:56:42,940 INFO L226 Difference]: Without dead ends: 364 [2018-04-10 14:56:42,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-04-10 14:56:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-10 14:56:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-04-10 14:56:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-10 14:56:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 365 transitions. [2018-04-10 14:56:42,947 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 365 transitions. Word has length 298 [2018-04-10 14:56:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:42,947 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 365 transitions. [2018-04-10 14:56:42,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:56:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 365 transitions. [2018-04-10 14:56:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-10 14:56:42,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:42,950 INFO L355 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:42,950 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -604052879, now seen corresponding path program 20 times [2018-04-10 14:56:42,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:42,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-04-10 14:56:43,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:43,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 14:56:43,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:43,358 INFO L182 omatonBuilderFactory]: Interpolants [8743#true, 8744#false, 8745#(<= 0 main_~i~1), 8746#(<= 1 main_~i~1), 8747#(<= 2 main_~i~1), 8748#(<= 3 main_~i~1), 8749#(<= 4 main_~i~1), 8750#(<= 5 main_~i~1), 8751#(<= 6 main_~i~1), 8752#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 8753#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 8754#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 8755#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 8756#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 8757#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 8758#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 8759#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 8760#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 6)] [2018-04-10 14:56:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-04-10 14:56:43,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:56:43,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:56:43,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:56:43,359 INFO L87 Difference]: Start difference. First operand 362 states and 365 transitions. Second operand 18 states. [2018-04-10 14:56:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:43,616 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-04-10 14:56:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 14:56:43,616 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2018-04-10 14:56:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:43,617 INFO L225 Difference]: With dead ends: 371 [2018-04-10 14:56:43,618 INFO L226 Difference]: Without dead ends: 365 [2018-04-10 14:56:43,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:56:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-10 14:56:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-04-10 14:56:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-10 14:56:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2018-04-10 14:56:43,622 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 352 [2018-04-10 14:56:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:43,622 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2018-04-10 14:56:43,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:56:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2018-04-10 14:56:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-10 14:56:43,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:43,624 INFO L355 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:43,624 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:43,624 INFO L82 PathProgramCache]: Analyzing trace with hash 608157801, now seen corresponding path program 21 times [2018-04-10 14:56:43,625 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:43,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-04-10 14:56:43,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:43,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:56:43,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:43,905 INFO L182 omatonBuilderFactory]: Interpolants [9506#true, 9507#false, 9508#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 9509#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 9510#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 9511#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 9512#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 9513#(and (<= 5 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 9514#(and (<= 6 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 9515#(and (<= 7 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 9516#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8) (<= 8 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0))] [2018-04-10 14:56:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-04-10 14:56:43,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:56:43,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:56:43,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:56:43,907 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 11 states. [2018-04-10 14:56:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:44,136 INFO L93 Difference]: Finished difference Result 374 states and 376 transitions. [2018-04-10 14:56:44,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:56:44,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 358 [2018-04-10 14:56:44,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:44,137 INFO L225 Difference]: With dead ends: 374 [2018-04-10 14:56:44,137 INFO L226 Difference]: Without dead ends: 374 [2018-04-10 14:56:44,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:56:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-10 14:56:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2018-04-10 14:56:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-10 14:56:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 370 transitions. [2018-04-10 14:56:44,145 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 370 transitions. Word has length 358 [2018-04-10 14:56:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:44,147 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 370 transitions. [2018-04-10 14:56:44,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:56:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2018-04-10 14:56:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-10 14:56:44,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:44,149 INFO L355 BasicCegarLoop]: trace histogram [52, 45, 44, 44, 44, 44, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:44,149 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash -992448415, now seen corresponding path program 22 times [2018-04-10 14:56:44,149 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:44,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-04-10 14:56:44,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:44,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 14:56:44,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:44,632 INFO L182 omatonBuilderFactory]: Interpolants [10272#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 10273#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 10274#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 10275#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 10276#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 10277#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 10278#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 10279#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 10280#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 10259#true, 10260#false, 10261#(= main_~i~1 0), 10262#(<= main_~i~1 1), 10263#(<= main_~i~1 2), 10264#(<= main_~i~1 3), 10265#(<= main_~i~1 4), 10266#(<= main_~i~1 5), 10267#(<= main_~i~1 6), 10268#(<= main_~i~1 7), 10269#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 8), 10270#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8), 10271#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8))] [2018-04-10 14:56:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-04-10 14:56:44,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:56:44,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:56:44,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:56:44,633 INFO L87 Difference]: Start difference. First operand 368 states and 370 transitions. Second operand 22 states. [2018-04-10 14:56:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:45,110 INFO L93 Difference]: Finished difference Result 436 states and 439 transitions. [2018-04-10 14:56:45,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:56:45,111 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 364 [2018-04-10 14:56:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:45,113 INFO L225 Difference]: With dead ends: 436 [2018-04-10 14:56:45,113 INFO L226 Difference]: Without dead ends: 436 [2018-04-10 14:56:45,113 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:56:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-10 14:56:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-04-10 14:56:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-10 14:56:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 437 transitions. [2018-04-10 14:56:45,121 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 437 transitions. Word has length 364 [2018-04-10 14:56:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:45,121 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 437 transitions. [2018-04-10 14:56:45,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:56:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 437 transitions. [2018-04-10 14:56:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-04-10 14:56:45,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:45,124 INFO L355 BasicCegarLoop]: trace histogram [61, 53, 52, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:45,124 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1036409983, now seen corresponding path program 23 times [2018-04-10 14:56:45,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:45,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-04-10 14:56:45,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:45,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 14:56:45,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:45,690 INFO L182 omatonBuilderFactory]: Interpolants [11171#true, 11172#false, 11173#(<= 0 main_~i~1), 11174#(<= 1 main_~i~1), 11175#(<= 2 main_~i~1), 11176#(<= 3 main_~i~1), 11177#(<= 4 main_~i~1), 11178#(<= 5 main_~i~1), 11179#(<= 6 main_~i~1), 11180#(<= 7 main_~i~1), 11181#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 11182#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 11183#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 11184#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 11185#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 11186#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 11187#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 11188#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 11189#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 11190#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 7)] [2018-04-10 14:56:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-04-10 14:56:45,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:56:45,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:56:45,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:56:45,691 INFO L87 Difference]: Start difference. First operand 434 states and 437 transitions. Second operand 20 states. [2018-04-10 14:56:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:46,070 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-04-10 14:56:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:56:46,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 424 [2018-04-10 14:56:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:46,073 INFO L225 Difference]: With dead ends: 443 [2018-04-10 14:56:46,073 INFO L226 Difference]: Without dead ends: 437 [2018-04-10 14:56:46,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-04-10 14:56:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-10 14:56:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2018-04-10 14:56:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-10 14:56:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-04-10 14:56:46,081 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 424 [2018-04-10 14:56:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:46,082 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-04-10 14:56:46,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:56:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-04-10 14:56:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-04-10 14:56:46,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:46,085 INFO L355 BasicCegarLoop]: trace histogram [62, 54, 53, 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-10 14:56:46,085 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash 64648569, now seen corresponding path program 24 times [2018-04-10 14:56:46,086 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:46,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-04-10 14:56:46,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:46,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:56:46,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:46,380 INFO L182 omatonBuilderFactory]: Interpolants [12082#true, 12083#false, 12084#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 12085#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 12086#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 12087#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 12088#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 12089#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 12090#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 12091#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 12092#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 12093#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 12094#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9))] [2018-04-10 14:56:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-04-10 14:56:46,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:56:46,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:56:46,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:56:46,381 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 13 states. [2018-04-10 14:56:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:46,479 INFO L93 Difference]: Finished difference Result 446 states and 448 transitions. [2018-04-10 14:56:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:56:46,479 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 430 [2018-04-10 14:56:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:46,480 INFO L225 Difference]: With dead ends: 446 [2018-04-10 14:56:46,480 INFO L226 Difference]: Without dead ends: 446 [2018-04-10 14:56:46,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:56:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-04-10 14:56:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2018-04-10 14:56:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-04-10 14:56:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 442 transitions. [2018-04-10 14:56:46,484 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 442 transitions. Word has length 430 [2018-04-10 14:56:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:46,485 INFO L459 AbstractCegarLoop]: Abstraction has 440 states and 442 transitions. [2018-04-10 14:56:46,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:56:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 442 transitions. [2018-04-10 14:56:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-10 14:56:46,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:46,486 INFO L355 BasicCegarLoop]: trace histogram [63, 55, 54, 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-10 14:56:46,486 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 523966833, now seen corresponding path program 25 times [2018-04-10 14:56:46,487 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:46,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-10 14:56:47,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:47,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 14:56:47,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:47,113 INFO L182 omatonBuilderFactory]: Interpolants [12997#true, 12998#false, 12999#(= main_~i~1 0), 13000#(<= main_~i~1 1), 13001#(<= main_~i~1 2), 13002#(<= main_~i~1 3), 13003#(<= main_~i~1 4), 13004#(<= main_~i~1 5), 13005#(<= main_~i~1 6), 13006#(<= main_~i~1 7), 13007#(<= main_~i~1 8), 13008#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 9), 13009#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9), 13010#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 13011#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 13012#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 13013#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 13014#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 13015#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 13016#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 13017#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 13018#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 13019#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 13020#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:56:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-10 14:56:47,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:56:47,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:56:47,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:56:47,114 INFO L87 Difference]: Start difference. First operand 440 states and 442 transitions. Second operand 24 states. [2018-04-10 14:56:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:47,561 INFO L93 Difference]: Finished difference Result 514 states and 517 transitions. [2018-04-10 14:56:47,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:56:47,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 436 [2018-04-10 14:56:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:47,563 INFO L225 Difference]: With dead ends: 514 [2018-04-10 14:56:47,563 INFO L226 Difference]: Without dead ends: 514 [2018-04-10 14:56:47,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:56:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-10 14:56:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2018-04-10 14:56:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-04-10 14:56:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 515 transitions. [2018-04-10 14:56:47,567 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 515 transitions. Word has length 436 [2018-04-10 14:56:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:47,567 INFO L459 AbstractCegarLoop]: Abstraction has 512 states and 515 transitions. [2018-04-10 14:56:47,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:56:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 515 transitions. [2018-04-10 14:56:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-10 14:56:47,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:47,570 INFO L355 BasicCegarLoop]: trace histogram [73, 64, 63, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:47,570 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash 282969737, now seen corresponding path program 26 times [2018-04-10 14:56:47,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:47,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-04-10 14:56:48,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:48,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 14:56:48,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:48,167 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 14081#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 14082#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 14083#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 14084#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 14085#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 14086#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 14087#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 14088#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 14089#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 14090#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 8), 14069#true, 14070#false, 14071#(<= 0 main_~i~1), 14072#(<= 1 main_~i~1), 14073#(<= 2 main_~i~1), 14074#(<= 3 main_~i~1), 14075#(<= 4 main_~i~1), 14076#(<= 5 main_~i~1), 14077#(<= 6 main_~i~1), 14078#(<= 7 main_~i~1), 14079#(<= 8 main_~i~1)] [2018-04-10 14:56:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-04-10 14:56:48,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:56:48,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:56:48,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:56:48,168 INFO L87 Difference]: Start difference. First operand 512 states and 515 transitions. Second operand 22 states. [2018-04-10 14:56:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:48,484 INFO L93 Difference]: Finished difference Result 521 states and 522 transitions. [2018-04-10 14:56:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:56:48,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 502 [2018-04-10 14:56:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:48,486 INFO L225 Difference]: With dead ends: 521 [2018-04-10 14:56:48,486 INFO L226 Difference]: Without dead ends: 515 [2018-04-10 14:56:48,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:56:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-04-10 14:56:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2018-04-10 14:56:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-04-10 14:56:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2018-04-10 14:56:48,492 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 502 [2018-04-10 14:56:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:48,493 INFO L459 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2018-04-10 14:56:48,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:56:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2018-04-10 14:56:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-04-10 14:56:48,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:48,496 INFO L355 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:48,496 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 870003329, now seen corresponding path program 27 times [2018-04-10 14:56:48,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:48,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-10 14:56:48,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:48,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 14:56:48,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:48,967 INFO L182 omatonBuilderFactory]: Interpolants [15140#true, 15141#false, 15142#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 15143#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 15144#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 15145#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 15146#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 15147#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 15148#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 15149#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 15150#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 15151#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 15152#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 15153#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0))] [2018-04-10 14:56:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-10 14:56:48,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:56:48,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:56:48,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:56:48,968 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 14 states. [2018-04-10 14:56:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:49,160 INFO L93 Difference]: Finished difference Result 524 states and 526 transitions. [2018-04-10 14:56:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 14:56:49,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 508 [2018-04-10 14:56:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:49,162 INFO L225 Difference]: With dead ends: 524 [2018-04-10 14:56:49,163 INFO L226 Difference]: Without dead ends: 524 [2018-04-10 14:56:49,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:56:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-10 14:56:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2018-04-10 14:56:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-10 14:56:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 520 transitions. [2018-04-10 14:56:49,170 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 520 transitions. Word has length 508 [2018-04-10 14:56:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:49,170 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 520 transitions. [2018-04-10 14:56:49,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:56:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 520 transitions. [2018-04-10 14:56:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-10 14:56:49,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:49,174 INFO L355 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:49,174 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash -265555847, now seen corresponding path program 28 times [2018-04-10 14:56:49,175 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:49,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-04-10 14:56:49,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:49,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 14:56:49,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:49,925 INFO L182 omatonBuilderFactory]: Interpolants [16214#true, 16215#false, 16216#(= main_~i~1 0), 16217#(<= main_~i~1 1), 16218#(<= main_~i~1 2), 16219#(<= main_~i~1 3), 16220#(<= main_~i~1 4), 16221#(<= main_~i~1 5), 16222#(<= main_~i~1 6), 16223#(<= main_~i~1 7), 16224#(<= main_~i~1 8), 16225#(<= main_~i~1 9), 16226#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 10), 16227#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10), 16228#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 16229#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 16230#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 16231#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 16232#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 16233#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 16234#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 16235#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 16236#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 16237#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 16238#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 16239#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:56:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-04-10 14:56:49,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:56:49,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:56:49,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:56:49,927 INFO L87 Difference]: Start difference. First operand 518 states and 520 transitions. Second operand 26 states. [2018-04-10 14:56:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:50,165 INFO L93 Difference]: Finished difference Result 598 states and 601 transitions. [2018-04-10 14:56:50,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:56:50,165 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 514 [2018-04-10 14:56:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:50,167 INFO L225 Difference]: With dead ends: 598 [2018-04-10 14:56:50,167 INFO L226 Difference]: Without dead ends: 598 [2018-04-10 14:56:50,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:56:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-04-10 14:56:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2018-04-10 14:56:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-04-10 14:56:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 599 transitions. [2018-04-10 14:56:50,172 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 599 transitions. Word has length 514 [2018-04-10 14:56:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:50,173 INFO L459 AbstractCegarLoop]: Abstraction has 596 states and 599 transitions. [2018-04-10 14:56:50,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:56:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 599 transitions. [2018-04-10 14:56:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-04-10 14:56:50,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:50,177 INFO L355 BasicCegarLoop]: trace histogram [86, 76, 75, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:50,177 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash -579703415, now seen corresponding path program 29 times [2018-04-10 14:56:50,178 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:50,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-04-10 14:56:50,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:50,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 14:56:50,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:50,815 INFO L182 omatonBuilderFactory]: Interpolants [17472#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 17473#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 17474#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 17475#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 17476#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 17477#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 17478#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 17479#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 17480#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 17481#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 9), 17458#true, 17459#false, 17460#(<= 0 main_~i~1), 17461#(<= 1 main_~i~1), 17462#(<= 2 main_~i~1), 17463#(<= 3 main_~i~1), 17464#(<= 4 main_~i~1), 17465#(<= 5 main_~i~1), 17466#(<= 6 main_~i~1), 17467#(<= 7 main_~i~1), 17468#(<= 8 main_~i~1), 17469#(<= 9 main_~i~1), 17470#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 17471#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1))] [2018-04-10 14:56:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-04-10 14:56:50,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:56:50,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:56:50,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:56:50,816 INFO L87 Difference]: Start difference. First operand 596 states and 599 transitions. Second operand 24 states. [2018-04-10 14:56:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:51,138 INFO L93 Difference]: Finished difference Result 605 states and 606 transitions. [2018-04-10 14:56:51,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:56:51,138 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 586 [2018-04-10 14:56:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:51,139 INFO L225 Difference]: With dead ends: 605 [2018-04-10 14:56:51,139 INFO L226 Difference]: Without dead ends: 599 [2018-04-10 14:56:51,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:56:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-10 14:56:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2018-04-10 14:56:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-04-10 14:56:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 597 transitions. [2018-04-10 14:56:51,145 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 597 transitions. Word has length 586 [2018-04-10 14:56:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:51,146 INFO L459 AbstractCegarLoop]: Abstraction has 596 states and 597 transitions. [2018-04-10 14:56:51,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:56:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 597 transitions. [2018-04-10 14:56:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-10 14:56:51,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:51,150 INFO L355 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:51,150 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1818728833, now seen corresponding path program 30 times [2018-04-10 14:56:51,151 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:51,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-10 14:56:51,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:51,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 14:56:51,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:51,697 INFO L182 omatonBuilderFactory]: Interpolants [18701#true, 18702#false, 18703#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 18704#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 18705#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 18706#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 18707#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 18708#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 18709#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 18710#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 18711#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 18712#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 18713#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 18714#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 18715#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11))] [2018-04-10 14:56:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-10 14:56:51,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 14:56:51,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 14:56:51,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:56:51,698 INFO L87 Difference]: Start difference. First operand 596 states and 597 transitions. Second operand 15 states. [2018-04-10 14:56:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:51,845 INFO L93 Difference]: Finished difference Result 608 states and 610 transitions. [2018-04-10 14:56:51,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:56:51,845 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 592 [2018-04-10 14:56:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:51,846 INFO L225 Difference]: With dead ends: 608 [2018-04-10 14:56:51,846 INFO L226 Difference]: Without dead ends: 608 [2018-04-10 14:56:51,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:56:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-10 14:56:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2018-04-10 14:56:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-10 14:56:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 604 transitions. [2018-04-10 14:56:51,852 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 604 transitions. Word has length 592 [2018-04-10 14:56:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:51,852 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 604 transitions. [2018-04-10 14:56:51,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 14:56:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 604 transitions. [2018-04-10 14:56:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-04-10 14:56:51,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:51,855 INFO L355 BasicCegarLoop]: trace histogram [88, 78, 77, 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-10 14:56:51,855 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:51,855 INFO L82 PathProgramCache]: Analyzing trace with hash 831461241, now seen corresponding path program 31 times [2018-04-10 14:56:51,856 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:51,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-10 14:56:52,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:52,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 14:56:52,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:52,580 INFO L182 omatonBuilderFactory]: Interpolants [19968#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 19969#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 19970#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 19971#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 19972#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 19973#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 19946#true, 19947#false, 19948#(= main_~i~1 0), 19949#(<= main_~i~1 1), 19950#(<= main_~i~1 2), 19951#(<= main_~i~1 3), 19952#(<= main_~i~1 4), 19953#(<= main_~i~1 5), 19954#(<= main_~i~1 6), 19955#(<= main_~i~1 7), 19956#(<= main_~i~1 8), 19957#(<= main_~i~1 9), 19958#(<= main_~i~1 10), 19959#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 11), 19960#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11), 19961#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 19962#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 19963#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 19964#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 19965#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 19966#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 19967#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5))] [2018-04-10 14:56:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-10 14:56:52,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:56:52,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:56:52,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:56:52,581 INFO L87 Difference]: Start difference. First operand 602 states and 604 transitions. Second operand 28 states. [2018-04-10 14:56:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:53,034 INFO L93 Difference]: Finished difference Result 688 states and 691 transitions. [2018-04-10 14:56:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 14:56:53,034 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 598 [2018-04-10 14:56:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:53,036 INFO L225 Difference]: With dead ends: 688 [2018-04-10 14:56:53,036 INFO L226 Difference]: Without dead ends: 688 [2018-04-10 14:56:53,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 14:56:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-04-10 14:56:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 686. [2018-04-10 14:56:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-10 14:56:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 689 transitions. [2018-04-10 14:56:53,041 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 689 transitions. Word has length 598 [2018-04-10 14:56:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:53,042 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 689 transitions. [2018-04-10 14:56:53,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:56:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 689 transitions. [2018-04-10 14:56:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-04-10 14:56:53,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:53,044 INFO L355 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:53,044 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1107841919, now seen corresponding path program 32 times [2018-04-10 14:56:53,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:53,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-04-10 14:56:53,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:53,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 14:56:53,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:53,866 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= 0 main_~i~1), 21377#(<= 1 main_~i~1), 21378#(<= 2 main_~i~1), 21379#(<= 3 main_~i~1), 21380#(<= 4 main_~i~1), 21381#(<= 5 main_~i~1), 21382#(<= 6 main_~i~1), 21383#(<= 7 main_~i~1), 21384#(<= 8 main_~i~1), 21385#(<= 9 main_~i~1), 21386#(<= 10 main_~i~1), 21387#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 21388#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 21389#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 21390#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 21391#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 21392#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 21393#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 21394#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 21395#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 21396#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 21397#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 21398#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 21399#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 10), 21374#true, 21375#false] [2018-04-10 14:56:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-04-10 14:56:53,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:56:53,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:56:53,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:56:53,867 INFO L87 Difference]: Start difference. First operand 686 states and 689 transitions. Second operand 26 states. [2018-04-10 14:56:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:54,249 INFO L93 Difference]: Finished difference Result 695 states and 696 transitions. [2018-04-10 14:56:54,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 14:56:54,249 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 676 [2018-04-10 14:56:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:54,250 INFO L225 Difference]: With dead ends: 695 [2018-04-10 14:56:54,250 INFO L226 Difference]: Without dead ends: 689 [2018-04-10 14:56:54,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=960, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 14:56:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-04-10 14:56:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 686. [2018-04-10 14:56:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-10 14:56:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 687 transitions. [2018-04-10 14:56:54,255 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 687 transitions. Word has length 676 [2018-04-10 14:56:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:54,255 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 687 transitions. [2018-04-10 14:56:54,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:56:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 687 transitions. [2018-04-10 14:56:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-04-10 14:56:54,259 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:54,259 INFO L355 BasicCegarLoop]: trace histogram [101, 90, 89, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:54,259 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:54,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1344323193, now seen corresponding path program 33 times [2018-04-10 14:56:54,260 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:54,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-10 14:56:54,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:54,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 14:56:54,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:54,809 INFO L182 omatonBuilderFactory]: Interpolants [22816#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 22801#true, 22802#false, 22803#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 22804#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 22805#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 22806#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 22807#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 22808#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 22809#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 22810#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 22811#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 22812#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 22813#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 22814#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 22815#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11))] [2018-04-10 14:56:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-10 14:56:54,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:56:54,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:56:54,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:56:54,809 INFO L87 Difference]: Start difference. First operand 686 states and 687 transitions. Second operand 16 states. [2018-04-10 14:56:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:55,042 INFO L93 Difference]: Finished difference Result 698 states and 700 transitions. [2018-04-10 14:56:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:56:55,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 682 [2018-04-10 14:56:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:55,043 INFO L225 Difference]: With dead ends: 698 [2018-04-10 14:56:55,043 INFO L226 Difference]: Without dead ends: 698 [2018-04-10 14:56:55,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2018-04-10 14:56:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-04-10 14:56:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 692. [2018-04-10 14:56:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-04-10 14:56:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 694 transitions. [2018-04-10 14:56:55,048 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 694 transitions. Word has length 682 [2018-04-10 14:56:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:55,048 INFO L459 AbstractCegarLoop]: Abstraction has 692 states and 694 transitions. [2018-04-10 14:56:55,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:56:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 694 transitions. [2018-04-10 14:56:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-04-10 14:56:55,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:55,052 INFO L355 BasicCegarLoop]: trace histogram [102, 91, 90, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:55,052 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:55,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1172742769, now seen corresponding path program 34 times [2018-04-10 14:56:55,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:55,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-10 14:56:56,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:56,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 14:56:56,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:56,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-10 14:56:56,009 INFO L182 omatonBuilderFactory]: Interpolants [24256#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 24257#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 24258#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 24229#true, 24230#false, 24231#(= main_~i~1 0), 24232#(<= main_~i~1 1), 24233#(<= main_~i~1 2), 24234#(<= main_~i~1 3), 24235#(<= main_~i~1 4), 24236#(<= main_~i~1 5), 24237#(<= main_~i~1 6), 24238#(<= main_~i~1 7), 24239#(<= main_~i~1 8), 24240#(<= main_~i~1 9), 24241#(<= main_~i~1 10), 24242#(<= main_~i~1 11), 24243#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 12), 24244#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12), 24245#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 24246#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 24247#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 24248#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 24249#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 24250#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 24251#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 24252#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 24253#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 24254#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 24255#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2))] [2018-04-10 14:56:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-10 14:56:56,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:56:56,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:56:56,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:56:56,010 INFO L87 Difference]: Start difference. First operand 692 states and 694 transitions. Second operand 30 states. [2018-04-10 14:56:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:56,563 INFO L93 Difference]: Finished difference Result 784 states and 787 transitions. [2018-04-10 14:56:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:56:56,563 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 688 [2018-04-10 14:56:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:56,564 INFO L225 Difference]: With dead ends: 784 [2018-04-10 14:56:56,564 INFO L226 Difference]: Without dead ends: 784 [2018-04-10 14:56:56,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:56:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-04-10 14:56:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2018-04-10 14:56:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-10 14:56:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 785 transitions. [2018-04-10 14:56:56,570 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 785 transitions. Word has length 688 [2018-04-10 14:56:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:56,570 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 785 transitions. [2018-04-10 14:56:56,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:56:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 785 transitions. [2018-04-10 14:56:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-04-10 14:56:56,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:56,574 INFO L355 BasicCegarLoop]: trace histogram [115, 103, 102, 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-10 14:56:56,574 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash 409831793, now seen corresponding path program 35 times [2018-04-10 14:56:56,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:56,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-04-10 14:56:57,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:57,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 14:56:57,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:57,638 INFO L182 omatonBuilderFactory]: Interpolants [25856#(<= 1 main_~i~1), 25857#(<= 2 main_~i~1), 25858#(<= 3 main_~i~1), 25859#(<= 4 main_~i~1), 25860#(<= 5 main_~i~1), 25861#(<= 6 main_~i~1), 25862#(<= 7 main_~i~1), 25863#(<= 8 main_~i~1), 25864#(<= 9 main_~i~1), 25865#(<= 10 main_~i~1), 25866#(<= 11 main_~i~1), 25867#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 25868#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 25869#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 25870#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 25871#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 25872#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 25873#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 25874#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 25875#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 25876#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 25877#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 25878#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 25879#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 25880#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 11), 25853#true, 25854#false, 25855#(<= 0 main_~i~1)] [2018-04-10 14:56:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-04-10 14:56:57,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:56:57,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:56:57,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:56:57,639 INFO L87 Difference]: Start difference. First operand 782 states and 785 transitions. Second operand 28 states. [2018-04-10 14:56:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:58,086 INFO L93 Difference]: Finished difference Result 791 states and 792 transitions. [2018-04-10 14:56:58,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 14:56:58,086 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 772 [2018-04-10 14:56:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:58,087 INFO L225 Difference]: With dead ends: 791 [2018-04-10 14:56:58,087 INFO L226 Difference]: Without dead ends: 785 [2018-04-10 14:56:58,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=1131, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:56:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-04-10 14:56:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 782. [2018-04-10 14:56:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-10 14:56:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 783 transitions. [2018-04-10 14:56:58,091 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 783 transitions. Word has length 772 [2018-04-10 14:56:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:58,092 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 783 transitions. [2018-04-10 14:56:58,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:56:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 783 transitions. [2018-04-10 14:56:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-04-10 14:56:58,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:58,095 INFO L355 BasicCegarLoop]: trace histogram [116, 104, 103, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:58,095 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1167448215, now seen corresponding path program 36 times [2018-04-10 14:56:58,095 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:58,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:56:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-04-10 14:56:58,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:56:58,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 14:56:58,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:56:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:56:58,728 INFO L182 omatonBuilderFactory]: Interpolants [27488#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 27489#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 27490#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 27491#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 27492#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 27476#true, 27477#false, 27478#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 27479#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 27480#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 27481#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 27482#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 27483#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 27484#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 27485#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 27486#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 27487#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)] [2018-04-10 14:56:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-04-10 14:56:58,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:56:58,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:56:58,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:56:58,729 INFO L87 Difference]: Start difference. First operand 782 states and 783 transitions. Second operand 17 states. [2018-04-10 14:56:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:56:58,889 INFO L93 Difference]: Finished difference Result 794 states and 796 transitions. [2018-04-10 14:56:58,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:56:58,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 778 [2018-04-10 14:56:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:56:58,891 INFO L225 Difference]: With dead ends: 794 [2018-04-10 14:56:58,891 INFO L226 Difference]: Without dead ends: 794 [2018-04-10 14:56:58,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-04-10 14:56:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-04-10 14:56:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 788. [2018-04-10 14:56:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-04-10 14:56:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 790 transitions. [2018-04-10 14:56:58,896 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 790 transitions. Word has length 778 [2018-04-10 14:56:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:56:58,897 INFO L459 AbstractCegarLoop]: Abstraction has 788 states and 790 transitions. [2018-04-10 14:56:58,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:56:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 790 transitions. [2018-04-10 14:56:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-04-10 14:56:58,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:56:58,902 INFO L355 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:56:58,902 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:56:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 895063905, now seen corresponding path program 37 times [2018-04-10 14:56:58,902 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:56:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:56:58,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-04-10 14:57:00,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:00,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 14:57:00,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:00,068 INFO L182 omatonBuilderFactory]: Interpolants [29120#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 29121#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 29122#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 29123#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 29124#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 29125#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 29126#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 29127#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 29128#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 29129#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 29130#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 29099#true, 29100#false, 29101#(= main_~i~1 0), 29102#(<= main_~i~1 1), 29103#(<= main_~i~1 2), 29104#(<= main_~i~1 3), 29105#(<= main_~i~1 4), 29106#(<= main_~i~1 5), 29107#(<= main_~i~1 6), 29108#(<= main_~i~1 7), 29109#(<= main_~i~1 8), 29110#(<= main_~i~1 9), 29111#(<= main_~i~1 10), 29112#(<= main_~i~1 11), 29113#(<= main_~i~1 12), 29114#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 13), 29115#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13), 29116#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 29117#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 29118#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 29119#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10))] [2018-04-10 14:57:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-04-10 14:57:00,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:57:00,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:57:00,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:57:00,069 INFO L87 Difference]: Start difference. First operand 788 states and 790 transitions. Second operand 32 states. [2018-04-10 14:57:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:00,630 INFO L93 Difference]: Finished difference Result 886 states and 889 transitions. [2018-04-10 14:57:00,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:57:00,630 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 784 [2018-04-10 14:57:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:00,632 INFO L225 Difference]: With dead ends: 886 [2018-04-10 14:57:00,632 INFO L226 Difference]: Without dead ends: 886 [2018-04-10 14:57:00,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=529, Invalid=1633, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:57:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-04-10 14:57:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2018-04-10 14:57:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-04-10 14:57:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 887 transitions. [2018-04-10 14:57:00,637 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 887 transitions. Word has length 784 [2018-04-10 14:57:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:00,637 INFO L459 AbstractCegarLoop]: Abstraction has 884 states and 887 transitions. [2018-04-10 14:57:00,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:57:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 887 transitions. [2018-04-10 14:57:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-04-10 14:57:00,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:00,641 INFO L355 BasicCegarLoop]: trace histogram [131, 118, 117, 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-10 14:57:00,641 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash -165184423, now seen corresponding path program 38 times [2018-04-10 14:57:00,642 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:00,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-04-10 14:57:02,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:02,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 14:57:02,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:02,280 INFO L182 omatonBuilderFactory]: Interpolants [30931#true, 30932#false, 30933#(<= 0 main_~i~1), 30934#(<= 1 main_~i~1), 30935#(<= 2 main_~i~1), 30936#(<= 3 main_~i~1), 30937#(<= 4 main_~i~1), 30938#(<= 5 main_~i~1), 30939#(<= 6 main_~i~1), 30940#(<= 7 main_~i~1), 30941#(<= 8 main_~i~1), 30942#(<= 9 main_~i~1), 30943#(<= 10 main_~i~1), 30944#(<= 11 main_~i~1), 30945#(<= 12 main_~i~1), 30946#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 30947#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 30948#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 30949#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 30950#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 30951#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 30952#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 30953#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 30954#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 30955#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 30956#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 30957#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 30958#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 30959#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 30960#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 12)] [2018-04-10 14:57:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-04-10 14:57:02,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:57:02,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:57:02,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:57:02,282 INFO L87 Difference]: Start difference. First operand 884 states and 887 transitions. Second operand 30 states. [2018-04-10 14:57:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:02,809 INFO L93 Difference]: Finished difference Result 893 states and 894 transitions. [2018-04-10 14:57:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 14:57:02,810 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 874 [2018-04-10 14:57:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:02,811 INFO L225 Difference]: With dead ends: 893 [2018-04-10 14:57:02,811 INFO L226 Difference]: Without dead ends: 887 [2018-04-10 14:57:02,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1316, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:57:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-04-10 14:57:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2018-04-10 14:57:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-04-10 14:57:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 885 transitions. [2018-04-10 14:57:02,816 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 885 transitions. Word has length 874 [2018-04-10 14:57:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:02,817 INFO L459 AbstractCegarLoop]: Abstraction has 884 states and 885 transitions. [2018-04-10 14:57:02,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:57:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 885 transitions. [2018-04-10 14:57:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-04-10 14:57:02,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:02,821 INFO L355 BasicCegarLoop]: trace histogram [132, 119, 118, 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-10 14:57:02,821 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1508029359, now seen corresponding path program 39 times [2018-04-10 14:57:02,822 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:02,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-04-10 14:57:03,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:03,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 14:57:03,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:03,641 INFO L182 omatonBuilderFactory]: Interpolants [32768#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 32769#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 32770#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 32771#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 32772#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 32773#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 32774#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 32775#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 32776#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 32777#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 32778#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 32779#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 32762#true, 32763#false, 32764#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 32765#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 32766#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 32767#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)] [2018-04-10 14:57:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-04-10 14:57:03,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:57:03,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:57:03,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:57:03,642 INFO L87 Difference]: Start difference. First operand 884 states and 885 transitions. Second operand 18 states. [2018-04-10 14:57:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:03,843 INFO L93 Difference]: Finished difference Result 896 states and 898 transitions. [2018-04-10 14:57:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 14:57:03,843 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 880 [2018-04-10 14:57:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:03,845 INFO L225 Difference]: With dead ends: 896 [2018-04-10 14:57:03,845 INFO L226 Difference]: Without dead ends: 896 [2018-04-10 14:57:03,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:57:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-04-10 14:57:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 890. [2018-04-10 14:57:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-10 14:57:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 892 transitions. [2018-04-10 14:57:03,855 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 892 transitions. Word has length 880 [2018-04-10 14:57:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:03,856 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 892 transitions. [2018-04-10 14:57:03,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:57:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 892 transitions. [2018-04-10 14:57:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-04-10 14:57:03,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:03,862 INFO L355 BasicCegarLoop]: trace histogram [133, 120, 119, 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-10 14:57:03,862 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1614320055, now seen corresponding path program 40 times [2018-04-10 14:57:03,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:03,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-10 14:57:05,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:05,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 14:57:05,339 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:05,339 INFO L182 omatonBuilderFactory]: Interpolants [34624#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 34625#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 34592#true, 34593#false, 34594#(= main_~i~1 0), 34595#(<= main_~i~1 1), 34596#(<= main_~i~1 2), 34597#(<= main_~i~1 3), 34598#(<= main_~i~1 4), 34599#(<= main_~i~1 5), 34600#(<= main_~i~1 6), 34601#(<= main_~i~1 7), 34602#(<= main_~i~1 8), 34603#(<= main_~i~1 9), 34604#(<= main_~i~1 10), 34605#(<= main_~i~1 11), 34606#(<= main_~i~1 12), 34607#(<= main_~i~1 13), 34608#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 14), 34609#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14), 34610#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 34611#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 34612#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 34613#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 34614#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 34615#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 34616#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 34617#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 34618#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 34619#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 34620#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 34621#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 34622#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 34623#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1))] [2018-04-10 14:57:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-10 14:57:05,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 14:57:05,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 14:57:05,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:57:05,340 INFO L87 Difference]: Start difference. First operand 890 states and 892 transitions. Second operand 34 states. [2018-04-10 14:57:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:05,969 INFO L93 Difference]: Finished difference Result 994 states and 997 transitions. [2018-04-10 14:57:05,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 14:57:05,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 886 [2018-04-10 14:57:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:05,972 INFO L225 Difference]: With dead ends: 994 [2018-04-10 14:57:05,972 INFO L226 Difference]: Without dead ends: 994 [2018-04-10 14:57:05,972 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=596, Invalid=1854, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:57:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-04-10 14:57:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2018-04-10 14:57:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-04-10 14:57:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 995 transitions. [2018-04-10 14:57:05,978 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 995 transitions. Word has length 886 [2018-04-10 14:57:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:05,978 INFO L459 AbstractCegarLoop]: Abstraction has 992 states and 995 transitions. [2018-04-10 14:57:05,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 14:57:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 995 transitions. [2018-04-10 14:57:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-04-10 14:57:05,983 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:05,983 INFO L355 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:05,983 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash 76312377, now seen corresponding path program 41 times [2018-04-10 14:57:05,984 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:06,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-04-10 14:57:07,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:07,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 14:57:07,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:07,631 INFO L182 omatonBuilderFactory]: Interpolants [36672#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 36673#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 36674#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 36675#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 13), 36644#true, 36645#false, 36646#(<= 0 main_~i~1), 36647#(<= 1 main_~i~1), 36648#(<= 2 main_~i~1), 36649#(<= 3 main_~i~1), 36650#(<= 4 main_~i~1), 36651#(<= 5 main_~i~1), 36652#(<= 6 main_~i~1), 36653#(<= 7 main_~i~1), 36654#(<= 8 main_~i~1), 36655#(<= 9 main_~i~1), 36656#(<= 10 main_~i~1), 36657#(<= 11 main_~i~1), 36658#(<= 12 main_~i~1), 36659#(<= 13 main_~i~1), 36660#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 36661#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 36662#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 36663#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 36664#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 36665#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 36666#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 36667#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 36668#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 36669#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 36670#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 36671#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11))] [2018-04-10 14:57:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-04-10 14:57:07,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:57:07,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:57:07,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:57:07,632 INFO L87 Difference]: Start difference. First operand 992 states and 995 transitions. Second operand 32 states. [2018-04-10 14:57:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:07,943 INFO L93 Difference]: Finished difference Result 1001 states and 1002 transitions. [2018-04-10 14:57:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 14:57:07,944 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 982 [2018-04-10 14:57:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:07,946 INFO L225 Difference]: With dead ends: 1001 [2018-04-10 14:57:07,946 INFO L226 Difference]: Without dead ends: 995 [2018-04-10 14:57:07,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=1515, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:57:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-04-10 14:57:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 992. [2018-04-10 14:57:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-04-10 14:57:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 993 transitions. [2018-04-10 14:57:07,952 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 993 transitions. Word has length 982 [2018-04-10 14:57:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:07,953 INFO L459 AbstractCegarLoop]: Abstraction has 992 states and 993 transitions. [2018-04-10 14:57:07,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:57:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 993 transitions. [2018-04-10 14:57:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-04-10 14:57:07,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:07,961 INFO L355 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:07,961 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1639344335, now seen corresponding path program 42 times [2018-04-10 14:57:07,962 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:08,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-10 14:57:09,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:09,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 14:57:09,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:09,038 INFO L182 omatonBuilderFactory]: Interpolants [38695#true, 38696#false, 38697#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 38698#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 38699#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 38700#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 38701#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 38702#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 38703#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 38704#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 38705#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 38706#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 38707#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 38708#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 38709#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 38710#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 38711#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 38712#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 38713#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15))] [2018-04-10 14:57:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-10 14:57:09,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:57:09,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:57:09,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:57:09,040 INFO L87 Difference]: Start difference. First operand 992 states and 993 transitions. Second operand 19 states. [2018-04-10 14:57:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:09,248 INFO L93 Difference]: Finished difference Result 1004 states and 1006 transitions. [2018-04-10 14:57:09,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 14:57:09,249 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 988 [2018-04-10 14:57:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:09,250 INFO L225 Difference]: With dead ends: 1004 [2018-04-10 14:57:09,250 INFO L226 Difference]: Without dead ends: 1004 [2018-04-10 14:57:09,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:57:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-04-10 14:57:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 998. [2018-04-10 14:57:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-04-10 14:57:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1000 transitions. [2018-04-10 14:57:09,258 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1000 transitions. Word has length 988 [2018-04-10 14:57:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:09,258 INFO L459 AbstractCegarLoop]: Abstraction has 998 states and 1000 transitions. [2018-04-10 14:57:09,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:57:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1000 transitions. [2018-04-10 14:57:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-04-10 14:57:09,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:09,265 INFO L355 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:09,265 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1652027095, now seen corresponding path program 43 times [2018-04-10 14:57:09,265 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:09,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-04-10 14:57:11,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:11,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 14:57:11,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:11,044 INFO L182 omatonBuilderFactory]: Interpolants [40768#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 40769#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 40770#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 40771#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 40772#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 40773#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 40774#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 40775#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 40776#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 40777#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 40778#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 40779#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 40744#true, 40745#false, 40746#(= main_~i~1 0), 40747#(<= main_~i~1 1), 40748#(<= main_~i~1 2), 40749#(<= main_~i~1 3), 40750#(<= main_~i~1 4), 40751#(<= main_~i~1 5), 40752#(<= main_~i~1 6), 40753#(<= main_~i~1 7), 40754#(<= main_~i~1 8), 40755#(<= main_~i~1 9), 40756#(<= main_~i~1 10), 40757#(<= main_~i~1 11), 40758#(<= main_~i~1 12), 40759#(<= main_~i~1 13), 40760#(<= main_~i~1 14), 40761#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 15), 40762#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15), 40763#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 40764#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 40765#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 40766#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 40767#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11))] [2018-04-10 14:57:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-04-10 14:57:11,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 14:57:11,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 14:57:11,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 14:57:11,045 INFO L87 Difference]: Start difference. First operand 998 states and 1000 transitions. Second operand 36 states. [2018-04-10 14:57:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:11,799 INFO L93 Difference]: Finished difference Result 1108 states and 1111 transitions. [2018-04-10 14:57:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 14:57:11,799 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 994 [2018-04-10 14:57:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:11,801 INFO L225 Difference]: With dead ends: 1108 [2018-04-10 14:57:11,801 INFO L226 Difference]: Without dead ends: 1108 [2018-04-10 14:57:11,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=667, Invalid=2089, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 14:57:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2018-04-10 14:57:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2018-04-10 14:57:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-10 14:57:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1109 transitions. [2018-04-10 14:57:11,807 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1109 transitions. Word has length 994 [2018-04-10 14:57:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:11,807 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1109 transitions. [2018-04-10 14:57:11,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 14:57:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1109 transitions. [2018-04-10 14:57:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2018-04-10 14:57:11,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:11,813 INFO L355 BasicCegarLoop]: trace histogram [166, 151, 150, 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-10 14:57:11,813 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash 759381521, now seen corresponding path program 44 times [2018-04-10 14:57:11,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:11,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-04-10 14:57:13,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:13,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 14:57:13,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:13,944 INFO L182 omatonBuilderFactory]: Interpolants [43028#true, 43029#false, 43030#(<= 0 main_~i~1), 43031#(<= 1 main_~i~1), 43032#(<= 2 main_~i~1), 43033#(<= 3 main_~i~1), 43034#(<= 4 main_~i~1), 43035#(<= 5 main_~i~1), 43036#(<= 6 main_~i~1), 43037#(<= 7 main_~i~1), 43038#(<= 8 main_~i~1), 43039#(<= 9 main_~i~1), 43040#(<= 10 main_~i~1), 43041#(<= 11 main_~i~1), 43042#(<= 12 main_~i~1), 43043#(<= 13 main_~i~1), 43044#(<= 14 main_~i~1), 43045#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 43046#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 43047#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 43048#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 43049#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 43050#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 43051#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 43052#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 43053#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 43054#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 43055#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 43056#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 43057#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 43058#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 43059#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 43060#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 43061#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 14)] [2018-04-10 14:57:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-04-10 14:57:13,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 14:57:13,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 14:57:13,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:57:13,945 INFO L87 Difference]: Start difference. First operand 1106 states and 1109 transitions. Second operand 34 states. [2018-04-10 14:57:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:14,616 INFO L93 Difference]: Finished difference Result 1115 states and 1116 transitions. [2018-04-10 14:57:14,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 14:57:14,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1096 [2018-04-10 14:57:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:14,619 INFO L225 Difference]: With dead ends: 1115 [2018-04-10 14:57:14,619 INFO L226 Difference]: Without dead ends: 1109 [2018-04-10 14:57:14,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=1728, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:57:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2018-04-10 14:57:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1106. [2018-04-10 14:57:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-10 14:57:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1107 transitions. [2018-04-10 14:57:14,625 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1107 transitions. Word has length 1096 [2018-04-10 14:57:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:14,626 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1107 transitions. [2018-04-10 14:57:14,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 14:57:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1107 transitions. [2018-04-10 14:57:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-04-10 14:57:14,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:14,631 INFO L355 BasicCegarLoop]: trace histogram [167, 152, 151, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:14,631 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1560222711, now seen corresponding path program 45 times [2018-04-10 14:57:14,632 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:14,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-10 14:57:16,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:16,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 14:57:16,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:16,006 INFO L182 omatonBuilderFactory]: Interpolants [45312#false, 45313#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 45314#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 45315#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 45316#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 45317#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 45318#(and (<= 5 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 45319#(and (<= 6 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 45320#(and (<= 7 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 45321#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8) (<= 8 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45322#(and (<= 9 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 45323#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10) (<= 10 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45324#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11) (<= 11 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45325#(and (<= 12 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 45326#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13) (<= 13 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45327#(and (<= 14 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 45328#(and (<= 15 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 45329#(and (<= 16 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 45311#true] [2018-04-10 14:57:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-10 14:57:16,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:57:16,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:57:16,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:57:16,008 INFO L87 Difference]: Start difference. First operand 1106 states and 1107 transitions. Second operand 19 states. [2018-04-10 14:57:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:16,509 INFO L93 Difference]: Finished difference Result 1118 states and 1120 transitions. [2018-04-10 14:57:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:57:16,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1102 [2018-04-10 14:57:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:16,511 INFO L225 Difference]: With dead ends: 1118 [2018-04-10 14:57:16,512 INFO L226 Difference]: Without dead ends: 1118 [2018-04-10 14:57:16,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:57:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2018-04-10 14:57:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1112. [2018-04-10 14:57:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-04-10 14:57:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1114 transitions. [2018-04-10 14:57:16,518 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1114 transitions. Word has length 1102 [2018-04-10 14:57:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:16,518 INFO L459 AbstractCegarLoop]: Abstraction has 1112 states and 1114 transitions. [2018-04-10 14:57:16,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:57:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1114 transitions. [2018-04-10 14:57:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-04-10 14:57:16,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:16,524 INFO L355 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:16,524 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash -120038399, now seen corresponding path program 46 times [2018-04-10 14:57:16,525 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:16,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-04-10 14:57:18,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:18,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 14:57:18,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:18,798 INFO L182 omatonBuilderFactory]: Interpolants [47560#true, 47561#false, 47562#(= main_~i~1 0), 47563#(<= main_~i~1 1), 47564#(<= main_~i~1 2), 47565#(<= main_~i~1 3), 47566#(<= main_~i~1 4), 47567#(<= main_~i~1 5), 47568#(<= main_~i~1 6), 47569#(<= main_~i~1 7), 47570#(<= main_~i~1 8), 47571#(<= main_~i~1 9), 47572#(<= main_~i~1 10), 47573#(<= main_~i~1 11), 47574#(<= main_~i~1 12), 47575#(<= main_~i~1 13), 47576#(<= main_~i~1 14), 47577#(<= main_~i~1 15), 47578#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 16), 47579#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16), 47580#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 47581#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 47582#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 47583#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 47584#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 47585#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 47586#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 47587#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 47588#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 47589#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 47590#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 47591#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 47592#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 47593#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 47594#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 47595#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 47596#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 47597#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:57:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-04-10 14:57:18,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 14:57:18,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 14:57:18,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:57:18,800 INFO L87 Difference]: Start difference. First operand 1112 states and 1114 transitions. Second operand 38 states. [2018-04-10 14:57:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:19,558 INFO L93 Difference]: Finished difference Result 1228 states and 1231 transitions. [2018-04-10 14:57:19,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 14:57:19,558 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1108 [2018-04-10 14:57:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:19,560 INFO L225 Difference]: With dead ends: 1228 [2018-04-10 14:57:19,560 INFO L226 Difference]: Without dead ends: 1228 [2018-04-10 14:57:19,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=742, Invalid=2338, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 14:57:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-04-10 14:57:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1226. [2018-04-10 14:57:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-04-10 14:57:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1229 transitions. [2018-04-10 14:57:19,566 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1229 transitions. Word has length 1108 [2018-04-10 14:57:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:19,566 INFO L459 AbstractCegarLoop]: Abstraction has 1226 states and 1229 transitions. [2018-04-10 14:57:19,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 14:57:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1229 transitions. [2018-04-10 14:57:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-04-10 14:57:19,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:19,573 INFO L355 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:19,573 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1881913057, now seen corresponding path program 47 times [2018-04-10 14:57:19,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:19,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-04-10 14:57:22,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:22,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 14:57:22,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:22,235 INFO L182 omatonBuilderFactory]: Interpolants [50112#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 50113#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 50114#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 50115#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 50116#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 50117#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 50118#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 50119#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 50120#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 50121#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 50122#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 50123#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 15), 50088#true, 50089#false, 50090#(<= 0 main_~i~1), 50091#(<= 1 main_~i~1), 50092#(<= 2 main_~i~1), 50093#(<= 3 main_~i~1), 50094#(<= 4 main_~i~1), 50095#(<= 5 main_~i~1), 50096#(<= 6 main_~i~1), 50097#(<= 7 main_~i~1), 50098#(<= 8 main_~i~1), 50099#(<= 9 main_~i~1), 50100#(<= 10 main_~i~1), 50101#(<= 11 main_~i~1), 50102#(<= 12 main_~i~1), 50103#(<= 13 main_~i~1), 50104#(<= 14 main_~i~1), 50105#(<= 15 main_~i~1), 50106#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 50107#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 50108#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 50109#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 50110#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 50111#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5))] [2018-04-10 14:57:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-04-10 14:57:22,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 14:57:22,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 14:57:22,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 14:57:22,237 INFO L87 Difference]: Start difference. First operand 1226 states and 1229 transitions. Second operand 36 states. [2018-04-10 14:57:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:22,814 INFO L93 Difference]: Finished difference Result 1235 states and 1236 transitions. [2018-04-10 14:57:22,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 14:57:22,814 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1216 [2018-04-10 14:57:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:22,817 INFO L225 Difference]: With dead ends: 1235 [2018-04-10 14:57:22,817 INFO L226 Difference]: Without dead ends: 1229 [2018-04-10 14:57:22,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=1955, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 14:57:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-04-10 14:57:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2018-04-10 14:57:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-04-10 14:57:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1227 transitions. [2018-04-10 14:57:22,824 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1227 transitions. Word has length 1216 [2018-04-10 14:57:22,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:22,824 INFO L459 AbstractCegarLoop]: Abstraction has 1226 states and 1227 transitions. [2018-04-10 14:57:22,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 14:57:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1227 transitions. [2018-04-10 14:57:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-04-10 14:57:22,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:22,832 INFO L355 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:22,832 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:22,832 INFO L82 PathProgramCache]: Analyzing trace with hash -460291879, now seen corresponding path program 48 times [2018-04-10 14:57:22,832 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:22,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-04-10 14:57:24,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:24,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 14:57:24,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:24,472 INFO L182 omatonBuilderFactory]: Interpolants [52615#true, 52616#false, 52617#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 52618#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 52619#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 52620#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 52621#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 52622#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 52623#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 52624#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 52625#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 52626#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 52627#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 52628#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 52629#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 52630#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 52631#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 52632#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 52633#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 52634#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 52635#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17))] [2018-04-10 14:57:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-04-10 14:57:24,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:57:24,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:57:24,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:57:24,474 INFO L87 Difference]: Start difference. First operand 1226 states and 1227 transitions. Second operand 21 states. [2018-04-10 14:57:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:24,693 INFO L93 Difference]: Finished difference Result 1238 states and 1240 transitions. [2018-04-10 14:57:24,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:57:24,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1222 [2018-04-10 14:57:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:24,695 INFO L225 Difference]: With dead ends: 1238 [2018-04-10 14:57:24,696 INFO L226 Difference]: Without dead ends: 1238 [2018-04-10 14:57:24,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:57:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-04-10 14:57:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-04-10 14:57:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-04-10 14:57:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-04-10 14:57:24,704 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1222 [2018-04-10 14:57:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:24,704 INFO L459 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-04-10 14:57:24,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:57:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-04-10 14:57:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-04-10 14:57:24,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:24,711 INFO L355 BasicCegarLoop]: trace histogram [187, 171, 170, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:24,712 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash -632087343, now seen corresponding path program 49 times [2018-04-10 14:57:24,712 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:24,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-04-10 14:57:27,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:27,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 14:57:27,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:27,573 INFO L182 omatonBuilderFactory]: Interpolants [55168#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 55169#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 55170#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 55171#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 55172#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 55173#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 55174#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 55175#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 55176#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 55177#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 55138#true, 55139#false, 55140#(= main_~i~1 0), 55141#(<= main_~i~1 1), 55142#(<= main_~i~1 2), 55143#(<= main_~i~1 3), 55144#(<= main_~i~1 4), 55145#(<= main_~i~1 5), 55146#(<= main_~i~1 6), 55147#(<= main_~i~1 7), 55148#(<= main_~i~1 8), 55149#(<= main_~i~1 9), 55150#(<= main_~i~1 10), 55151#(<= main_~i~1 11), 55152#(<= main_~i~1 12), 55153#(<= main_~i~1 13), 55154#(<= main_~i~1 14), 55155#(<= main_~i~1 15), 55156#(<= main_~i~1 16), 55157#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 17), 55158#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17), 55159#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 55160#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 55161#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 55162#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 55163#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 55164#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 55165#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 55166#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 55167#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9))] [2018-04-10 14:57:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-04-10 14:57:27,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 14:57:27,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 14:57:27,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 14:57:27,575 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 40 states. [2018-04-10 14:57:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:28,449 INFO L93 Difference]: Finished difference Result 1354 states and 1357 transitions. [2018-04-10 14:57:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:57:28,449 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1228 [2018-04-10 14:57:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:28,451 INFO L225 Difference]: With dead ends: 1354 [2018-04-10 14:57:28,451 INFO L226 Difference]: Without dead ends: 1354 [2018-04-10 14:57:28,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=821, Invalid=2601, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 14:57:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-04-10 14:57:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-04-10 14:57:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-04-10 14:57:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1355 transitions. [2018-04-10 14:57:28,457 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1355 transitions. Word has length 1228 [2018-04-10 14:57:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:28,458 INFO L459 AbstractCegarLoop]: Abstraction has 1352 states and 1355 transitions. [2018-04-10 14:57:28,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 14:57:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1355 transitions. [2018-04-10 14:57:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2018-04-10 14:57:28,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:28,466 INFO L355 BasicCegarLoop]: trace histogram [205, 188, 187, 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-10 14:57:28,466 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1642338729, now seen corresponding path program 50 times [2018-04-10 14:57:28,467 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:28,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-04-10 14:57:31,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:31,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 14:57:31,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:31,742 INFO L182 omatonBuilderFactory]: Interpolants [57922#true, 57923#false, 57924#(<= 0 main_~i~1), 57925#(<= 1 main_~i~1), 57926#(<= 2 main_~i~1), 57927#(<= 3 main_~i~1), 57928#(<= 4 main_~i~1), 57929#(<= 5 main_~i~1), 57930#(<= 6 main_~i~1), 57931#(<= 7 main_~i~1), 57932#(<= 8 main_~i~1), 57933#(<= 9 main_~i~1), 57934#(<= 10 main_~i~1), 57935#(<= 11 main_~i~1), 57936#(<= 12 main_~i~1), 57937#(<= 13 main_~i~1), 57938#(<= 14 main_~i~1), 57939#(<= 15 main_~i~1), 57940#(<= 16 main_~i~1), 57941#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 57942#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 57943#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 57944#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 57945#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 57946#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 57947#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 57948#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 57949#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 57950#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 57951#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 57952#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 57953#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 57954#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 57955#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 57956#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 57957#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 57958#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 57959#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 16)] [2018-04-10 14:57:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-04-10 14:57:31,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 14:57:31,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 14:57:31,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:57:31,745 INFO L87 Difference]: Start difference. First operand 1352 states and 1355 transitions. Second operand 38 states. [2018-04-10 14:57:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:32,574 INFO L93 Difference]: Finished difference Result 1361 states and 1362 transitions. [2018-04-10 14:57:32,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 14:57:32,574 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1342 [2018-04-10 14:57:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:32,576 INFO L225 Difference]: With dead ends: 1361 [2018-04-10 14:57:32,577 INFO L226 Difference]: Without dead ends: 1355 [2018-04-10 14:57:32,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=2196, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 14:57:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-04-10 14:57:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1352. [2018-04-10 14:57:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-04-10 14:57:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1353 transitions. [2018-04-10 14:57:32,585 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1353 transitions. Word has length 1342 [2018-04-10 14:57:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:32,585 INFO L459 AbstractCegarLoop]: Abstraction has 1352 states and 1353 transitions. [2018-04-10 14:57:32,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 14:57:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1353 transitions. [2018-04-10 14:57:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-04-10 14:57:32,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:32,593 INFO L355 BasicCegarLoop]: trace histogram [206, 189, 188, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:32,593 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:32,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1478054495, now seen corresponding path program 51 times [2018-04-10 14:57:32,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:32,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-04-10 14:57:34,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:34,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 14:57:34,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:34,662 INFO L182 omatonBuilderFactory]: Interpolants [60705#true, 60706#false, 60707#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 60708#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 60709#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 60710#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 60711#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 60712#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 60713#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 60714#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 60715#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 60716#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 60717#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 60718#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 60719#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 60720#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 60721#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 60722#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 60723#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 60724#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 60725#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 60726#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18))] [2018-04-10 14:57:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-04-10 14:57:34,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:57:34,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:57:34,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:57:34,664 INFO L87 Difference]: Start difference. First operand 1352 states and 1353 transitions. Second operand 22 states. [2018-04-10 14:57:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:34,936 INFO L93 Difference]: Finished difference Result 1364 states and 1366 transitions. [2018-04-10 14:57:34,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 14:57:34,936 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1348 [2018-04-10 14:57:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:34,938 INFO L225 Difference]: With dead ends: 1364 [2018-04-10 14:57:34,938 INFO L226 Difference]: Without dead ends: 1364 [2018-04-10 14:57:34,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:57:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-04-10 14:57:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1358. [2018-04-10 14:57:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-04-10 14:57:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1360 transitions. [2018-04-10 14:57:34,948 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1360 transitions. Word has length 1348 [2018-04-10 14:57:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:34,949 INFO L459 AbstractCegarLoop]: Abstraction has 1358 states and 1360 transitions. [2018-04-10 14:57:34,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:57:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1360 transitions. [2018-04-10 14:57:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-04-10 14:57:34,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:34,961 INFO L355 BasicCegarLoop]: trace histogram [207, 190, 189, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:34,961 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 724997017, now seen corresponding path program 52 times [2018-04-10 14:57:34,962 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:35,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-04-10 14:57:38,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:38,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 14:57:38,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:38,393 INFO L182 omatonBuilderFactory]: Interpolants [63488#(<= main_~i~1 3), 63489#(<= main_~i~1 4), 63490#(<= main_~i~1 5), 63491#(<= main_~i~1 6), 63492#(<= main_~i~1 7), 63493#(<= main_~i~1 8), 63494#(<= main_~i~1 9), 63495#(<= main_~i~1 10), 63496#(<= main_~i~1 11), 63497#(<= main_~i~1 12), 63498#(<= main_~i~1 13), 63499#(<= main_~i~1 14), 63500#(<= main_~i~1 15), 63501#(<= main_~i~1 16), 63502#(<= main_~i~1 17), 63503#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 18), 63504#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18), 63505#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 63506#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 63507#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 63508#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 63509#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 63510#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 63511#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 63512#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 63513#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 63514#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 63515#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 63516#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 63517#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 63518#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 63519#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 63520#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 63521#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 63522#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 63523#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 63524#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 63483#true, 63484#false, 63485#(= main_~i~1 0), 63486#(<= main_~i~1 1), 63487#(<= main_~i~1 2)] [2018-04-10 14:57:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-04-10 14:57:38,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 14:57:38,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 14:57:38,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:57:38,395 INFO L87 Difference]: Start difference. First operand 1358 states and 1360 transitions. Second operand 42 states. [2018-04-10 14:57:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:39,227 INFO L93 Difference]: Finished difference Result 1486 states and 1489 transitions. [2018-04-10 14:57:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 14:57:39,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1354 [2018-04-10 14:57:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:39,229 INFO L225 Difference]: With dead ends: 1486 [2018-04-10 14:57:39,229 INFO L226 Difference]: Without dead ends: 1486 [2018-04-10 14:57:39,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=904, Invalid=2878, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 14:57:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2018-04-10 14:57:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1484. [2018-04-10 14:57:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-04-10 14:57:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1487 transitions. [2018-04-10 14:57:39,238 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1487 transitions. Word has length 1354 [2018-04-10 14:57:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:39,238 INFO L459 AbstractCegarLoop]: Abstraction has 1484 states and 1487 transitions. [2018-04-10 14:57:39,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 14:57:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1487 transitions. [2018-04-10 14:57:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-04-10 14:57:39,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:39,247 INFO L355 BasicCegarLoop]: trace histogram [226, 208, 207, 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-10 14:57:39,247 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash -637855639, now seen corresponding path program 53 times [2018-04-10 14:57:39,248 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:39,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-04-10 14:57:43,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:43,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 14:57:43,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:43,266 INFO L182 omatonBuilderFactory]: Interpolants [66561#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 66560#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 66563#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 66562#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 66565#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 66564#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 66567#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 66566#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 66569#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 66568#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 66571#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 66570#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 66573#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 66572#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 66574#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 17), 66535#true, 66537#(<= 0 main_~i~1), 66536#false, 66539#(<= 2 main_~i~1), 66538#(<= 1 main_~i~1), 66541#(<= 4 main_~i~1), 66540#(<= 3 main_~i~1), 66543#(<= 6 main_~i~1), 66542#(<= 5 main_~i~1), 66545#(<= 8 main_~i~1), 66544#(<= 7 main_~i~1), 66547#(<= 10 main_~i~1), 66546#(<= 9 main_~i~1), 66549#(<= 12 main_~i~1), 66548#(<= 11 main_~i~1), 66551#(<= 14 main_~i~1), 66550#(<= 13 main_~i~1), 66553#(<= 16 main_~i~1), 66552#(<= 15 main_~i~1), 66555#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 66554#(<= 17 main_~i~1), 66557#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 66556#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 66559#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 66558#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3))] [2018-04-10 14:57:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-04-10 14:57:43,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 14:57:43,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 14:57:43,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 14:57:43,269 INFO L87 Difference]: Start difference. First operand 1484 states and 1487 transitions. Second operand 40 states. [2018-04-10 14:57:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:43,854 INFO L93 Difference]: Finished difference Result 1493 states and 1494 transitions. [2018-04-10 14:57:43,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 14:57:43,854 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1474 [2018-04-10 14:57:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:43,856 INFO L225 Difference]: With dead ends: 1493 [2018-04-10 14:57:43,856 INFO L226 Difference]: Without dead ends: 1487 [2018-04-10 14:57:43,857 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=2451, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 14:57:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-04-10 14:57:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1484. [2018-04-10 14:57:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-04-10 14:57:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1485 transitions. [2018-04-10 14:57:43,863 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1485 transitions. Word has length 1474 [2018-04-10 14:57:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:43,863 INFO L459 AbstractCegarLoop]: Abstraction has 1484 states and 1485 transitions. [2018-04-10 14:57:43,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 14:57:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1485 transitions. [2018-04-10 14:57:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-04-10 14:57:43,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:43,873 INFO L355 BasicCegarLoop]: trace histogram [227, 209, 208, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:43,873 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash 121936993, now seen corresponding path program 54 times [2018-04-10 14:57:43,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:43,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-04-10 14:57:46,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:46,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 14:57:46,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:46,331 INFO L182 omatonBuilderFactory]: Interpolants [69601#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 69600#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 69603#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 69602#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 69605#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 69604#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 69607#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 69606#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 69608#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 69587#false, 69586#true, 69589#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 69588#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 69591#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 69590#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 69593#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 69592#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 69595#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 69594#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 69597#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 69596#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 69599#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 69598#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)] [2018-04-10 14:57:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-04-10 14:57:46,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 14:57:46,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 14:57:46,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=290, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:57:46,333 INFO L87 Difference]: Start difference. First operand 1484 states and 1485 transitions. Second operand 23 states. [2018-04-10 14:57:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:46,594 INFO L93 Difference]: Finished difference Result 1496 states and 1498 transitions. [2018-04-10 14:57:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:57:46,595 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1480 [2018-04-10 14:57:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:46,596 INFO L225 Difference]: With dead ends: 1496 [2018-04-10 14:57:46,596 INFO L226 Difference]: Without dead ends: 1496 [2018-04-10 14:57:46,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 14:57:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2018-04-10 14:57:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1490. [2018-04-10 14:57:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-04-10 14:57:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1492 transitions. [2018-04-10 14:57:46,602 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1492 transitions. Word has length 1480 [2018-04-10 14:57:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:46,602 INFO L459 AbstractCegarLoop]: Abstraction has 1490 states and 1492 transitions. [2018-04-10 14:57:46,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 14:57:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1492 transitions. [2018-04-10 14:57:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1487 [2018-04-10 14:57:46,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:46,611 INFO L355 BasicCegarLoop]: trace histogram [228, 210, 209, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:46,611 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2003406247, now seen corresponding path program 55 times [2018-04-10 14:57:46,612 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:46,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 25162 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-10 14:57:50,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:50,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-10 14:57:50,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:50,926 INFO L182 omatonBuilderFactory]: Interpolants [72641#(<= main_~i~1 8), 72640#(<= main_~i~1 7), 72643#(<= main_~i~1 10), 72642#(<= main_~i~1 9), 72645#(<= main_~i~1 12), 72644#(<= main_~i~1 11), 72647#(<= main_~i~1 14), 72646#(<= main_~i~1 13), 72649#(<= main_~i~1 16), 72648#(<= main_~i~1 15), 72651#(<= main_~i~1 18), 72650#(<= main_~i~1 17), 72653#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19), 72652#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 19), 72655#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 72654#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 72657#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 72656#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 72659#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 72658#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 72661#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 72660#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 72663#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 72662#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 72665#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 72664#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 72667#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 72666#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 72669#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 72668#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 72671#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 72670#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 72673#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 72672#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 72674#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 72631#true, 72633#(= main_~i~1 0), 72632#false, 72635#(<= main_~i~1 2), 72634#(<= main_~i~1 1), 72637#(<= main_~i~1 4), 72636#(<= main_~i~1 3), 72639#(<= main_~i~1 6), 72638#(<= main_~i~1 5)] [2018-04-10 14:57:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 25162 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-10 14:57:50,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 14:57:50,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 14:57:50,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:57:50,929 INFO L87 Difference]: Start difference. First operand 1490 states and 1492 transitions. Second operand 44 states. [2018-04-10 14:57:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:51,617 INFO L93 Difference]: Finished difference Result 1624 states and 1627 transitions. [2018-04-10 14:57:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 14:57:51,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1486 [2018-04-10 14:57:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:51,619 INFO L225 Difference]: With dead ends: 1624 [2018-04-10 14:57:51,619 INFO L226 Difference]: Without dead ends: 1624 [2018-04-10 14:57:51,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=991, Invalid=3169, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 14:57:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2018-04-10 14:57:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1622. [2018-04-10 14:57:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-04-10 14:57:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1625 transitions. [2018-04-10 14:57:51,625 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1625 transitions. Word has length 1486 [2018-04-10 14:57:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:51,626 INFO L459 AbstractCegarLoop]: Abstraction has 1622 states and 1625 transitions. [2018-04-10 14:57:51,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 14:57:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1625 transitions. [2018-04-10 14:57:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1613 [2018-04-10 14:57:51,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:51,636 INFO L355 BasicCegarLoop]: trace histogram [248, 229, 228, 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-10 14:57:51,636 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash -330410207, now seen corresponding path program 56 times [2018-04-10 14:57:51,637 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:51,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:57:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-04-10 14:57:56,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:57:56,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 14:57:56,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:57:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:57:56,637 INFO L182 omatonBuilderFactory]: Interpolants [75969#(<= 4 main_~i~1), 75968#(<= 3 main_~i~1), 75971#(<= 6 main_~i~1), 75970#(<= 5 main_~i~1), 75973#(<= 8 main_~i~1), 75972#(<= 7 main_~i~1), 75975#(<= 10 main_~i~1), 75974#(<= 9 main_~i~1), 75977#(<= 12 main_~i~1), 75976#(<= 11 main_~i~1), 75979#(<= 14 main_~i~1), 75978#(<= 13 main_~i~1), 75981#(<= 16 main_~i~1), 75980#(<= 15 main_~i~1), 75983#(<= 18 main_~i~1), 75982#(<= 17 main_~i~1), 75985#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 75984#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 75987#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 75986#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 75989#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 75988#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 75991#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 75990#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 75993#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 75992#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 75995#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 75994#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 75997#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 75996#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 75999#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 75998#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 76001#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 76000#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 76003#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 76002#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 76004#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 18), 75963#true, 75965#(<= 0 main_~i~1), 75964#false, 75967#(<= 2 main_~i~1), 75966#(<= 1 main_~i~1)] [2018-04-10 14:57:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-04-10 14:57:56,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 14:57:56,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 14:57:56,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1280, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:57:56,640 INFO L87 Difference]: Start difference. First operand 1622 states and 1625 transitions. Second operand 42 states. [2018-04-10 14:57:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:57:57,368 INFO L93 Difference]: Finished difference Result 1631 states and 1632 transitions. [2018-04-10 14:57:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 14:57:57,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1612 [2018-04-10 14:57:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:57:57,371 INFO L225 Difference]: With dead ends: 1631 [2018-04-10 14:57:57,371 INFO L226 Difference]: Without dead ends: 1625 [2018-04-10 14:57:57,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=820, Invalid=2720, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 14:57:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-04-10 14:57:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1622. [2018-04-10 14:57:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-04-10 14:57:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1623 transitions. [2018-04-10 14:57:57,379 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1623 transitions. Word has length 1612 [2018-04-10 14:57:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:57:57,379 INFO L459 AbstractCegarLoop]: Abstraction has 1622 states and 1623 transitions. [2018-04-10 14:57:57,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 14:57:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1623 transitions. [2018-04-10 14:57:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-04-10 14:57:57,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:57:57,390 INFO L355 BasicCegarLoop]: trace histogram [249, 230, 229, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:57:57,390 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:57:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash 180154649, now seen corresponding path program 57 times [2018-04-10 14:57:57,391 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:57:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:57:57,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-10 14:58:00,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:00,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 14:58:00,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:00,447 INFO L182 omatonBuilderFactory]: Interpolants [79297#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 79296#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 79299#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 79298#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 79301#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 79300#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 79303#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 79302#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 79305#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 79304#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 79307#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 79306#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 79309#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 79308#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 79311#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 79310#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 79313#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 79312#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 79315#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 79314#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 79317#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20) (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 79316#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 79295#false, 79294#true] [2018-04-10 14:58:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-10 14:58:00,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:58:00,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:58:00,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:58:00,449 INFO L87 Difference]: Start difference. First operand 1622 states and 1623 transitions. Second operand 24 states. [2018-04-10 14:58:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:00,793 INFO L93 Difference]: Finished difference Result 1634 states and 1636 transitions. [2018-04-10 14:58:00,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 14:58:00,793 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1618 [2018-04-10 14:58:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:00,795 INFO L225 Difference]: With dead ends: 1634 [2018-04-10 14:58:00,795 INFO L226 Difference]: Without dead ends: 1634 [2018-04-10 14:58:00,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=560, Invalid=1246, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 14:58:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-04-10 14:58:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1628. [2018-04-10 14:58:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-04-10 14:58:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1630 transitions. [2018-04-10 14:58:00,803 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1630 transitions. Word has length 1618 [2018-04-10 14:58:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:00,804 INFO L459 AbstractCegarLoop]: Abstraction has 1628 states and 1630 transitions. [2018-04-10 14:58:00,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:58:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1630 transitions. [2018-04-10 14:58:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-04-10 14:58:00,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:00,815 INFO L355 BasicCegarLoop]: trace histogram [250, 231, 230, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:58:00,815 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1560650479, now seen corresponding path program 58 times [2018-04-10 14:58:00,815 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:00,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-10 14:58:06,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:06,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-10 14:58:06,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:06,268 INFO L182 omatonBuilderFactory]: Interpolants [82625#(<= main_~i~1 5), 82624#(<= main_~i~1 4), 82627#(<= main_~i~1 7), 82626#(<= main_~i~1 6), 82629#(<= main_~i~1 9), 82628#(<= main_~i~1 8), 82631#(<= main_~i~1 11), 82630#(<= main_~i~1 10), 82633#(<= main_~i~1 13), 82632#(<= main_~i~1 12), 82635#(<= main_~i~1 15), 82634#(<= main_~i~1 14), 82637#(<= main_~i~1 17), 82636#(<= main_~i~1 16), 82639#(<= main_~i~1 19), 82638#(<= main_~i~1 18), 82641#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20), 82640#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 20), 82643#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 82642#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 82645#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 82644#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 82647#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 82646#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 82649#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 82648#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 82651#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 82650#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 82653#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 82652#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 82655#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 82654#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 82657#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 82656#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 82659#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 82658#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 82661#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 82660#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 82663#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 82662#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 82619#false, 82618#true, 82621#(<= main_~i~1 1), 82620#(= main_~i~1 0), 82623#(<= main_~i~1 3), 82622#(<= main_~i~1 2)] [2018-04-10 14:58:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-10 14:58:06,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:58:06,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:58:06,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:58:06,270 INFO L87 Difference]: Start difference. First operand 1628 states and 1630 transitions. Second operand 46 states. [2018-04-10 14:58:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:07,026 INFO L93 Difference]: Finished difference Result 1768 states and 1771 transitions. [2018-04-10 14:58:07,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 14:58:07,026 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1624 [2018-04-10 14:58:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:07,028 INFO L225 Difference]: With dead ends: 1768 [2018-04-10 14:58:07,029 INFO L226 Difference]: Without dead ends: 1768 [2018-04-10 14:58:07,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1082, Invalid=3474, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 14:58:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-04-10 14:58:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2018-04-10 14:58:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2018-04-10 14:58:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 1769 transitions. [2018-04-10 14:58:07,037 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 1769 transitions. Word has length 1624 [2018-04-10 14:58:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:07,037 INFO L459 AbstractCegarLoop]: Abstraction has 1766 states and 1769 transitions. [2018-04-10 14:58:07,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:58:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 1769 transitions. [2018-04-10 14:58:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-04-10 14:58:07,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:07,051 INFO L355 BasicCegarLoop]: trace histogram [271, 251, 250, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:58:07,051 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash 963996625, now seen corresponding path program 59 times [2018-04-10 14:58:07,051 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:07,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 55569 proven. 3846 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-10 14:58:14,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:14,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 14:58:14,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:14,017 INFO L182 omatonBuilderFactory]: Interpolants [86273#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 86272#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 86275#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 86274#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 86277#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 86276#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 86279#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 86278#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 86281#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 86280#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 86283#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 86282#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 86285#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 86284#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 86287#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 86286#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 86289#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 86288#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 86291#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 86290#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 86243#false, 86242#true, 86245#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 86244#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 86247#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 86246#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 86249#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 86248#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 86251#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 86250#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 86253#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 86252#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 86255#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 86254#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 86257#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 86256#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 86259#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 86258#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 86261#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 86260#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 86263#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 86262#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 86265#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 19), 86264#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 86267#(<= main_~i~1 19), 86266#(<= main_~i~1 18), 86269#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20), 86268#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 20), 86271#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 86270#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20))] [2018-04-10 14:58:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 55569 proven. 3846 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-10 14:58:14,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 14:58:14,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 14:58:14,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1910, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:58:14,021 INFO L87 Difference]: Start difference. First operand 1766 states and 1769 transitions. Second operand 50 states. [2018-04-10 14:58:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:15,327 INFO L93 Difference]: Finished difference Result 1918 states and 1922 transitions. [2018-04-10 14:58:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-10 14:58:15,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1756 [2018-04-10 14:58:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:15,330 INFO L225 Difference]: With dead ends: 1918 [2018-04-10 14:58:15,330 INFO L226 Difference]: Without dead ends: 1918 [2018-04-10 14:58:15,330 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2332, Invalid=6598, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 14:58:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2018-04-10 14:58:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1772. [2018-04-10 14:58:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-04-10 14:58:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 1775 transitions. [2018-04-10 14:58:15,344 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 1775 transitions. Word has length 1756 [2018-04-10 14:58:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:15,345 INFO L459 AbstractCegarLoop]: Abstraction has 1772 states and 1775 transitions. [2018-04-10 14:58:15,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 14:58:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 1775 transitions. [2018-04-10 14:58:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2018-04-10 14:58:15,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:15,367 INFO L355 BasicCegarLoop]: trace histogram [272, 252, 251, 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-10 14:58:15,367 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1134640695, now seen corresponding path program 60 times [2018-04-10 14:58:15,368 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:15,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-04-10 14:58:19,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:19,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 14:58:19,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:19,206 INFO L182 omatonBuilderFactory]: Interpolants [90073#false, 90072#true, 90075#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 90074#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 90077#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 90076#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 90079#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 90078#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 90081#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 90080#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 90083#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 90082#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 90085#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 90084#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 90087#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 90086#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 90089#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 90088#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 90091#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 90090#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 90093#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 90092#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 90095#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 90094#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 90096#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21))] [2018-04-10 14:58:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-04-10 14:58:19,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 14:58:19,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 14:58:19,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:58:19,209 INFO L87 Difference]: Start difference. First operand 1772 states and 1775 transitions. Second operand 25 states. [2018-04-10 14:58:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:19,522 INFO L93 Difference]: Finished difference Result 1784 states and 1788 transitions. [2018-04-10 14:58:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:58:19,522 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1762 [2018-04-10 14:58:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:19,525 INFO L225 Difference]: With dead ends: 1784 [2018-04-10 14:58:19,525 INFO L226 Difference]: Without dead ends: 1784 [2018-04-10 14:58:19,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:58:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2018-04-10 14:58:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1778. [2018-04-10 14:58:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-04-10 14:58:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1782 transitions. [2018-04-10 14:58:19,534 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1782 transitions. Word has length 1762 [2018-04-10 14:58:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:19,535 INFO L459 AbstractCegarLoop]: Abstraction has 1778 states and 1782 transitions. [2018-04-10 14:58:19,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 14:58:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1782 transitions. [2018-04-10 14:58:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-04-10 14:58:19,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:19,548 INFO L355 BasicCegarLoop]: trace histogram [273, 253, 252, 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-10 14:58:19,549 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:19,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1179183553, now seen corresponding path program 61 times [2018-04-10 14:58:19,549 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:19,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-10 14:58:26,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:26,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 14:58:26,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:26,100 INFO L182 omatonBuilderFactory]: Interpolants [93699#true, 93701#(= main_~i~1 0), 93700#false, 93703#(<= main_~i~1 2), 93702#(<= main_~i~1 1), 93705#(<= main_~i~1 4), 93704#(<= main_~i~1 3), 93707#(<= main_~i~1 6), 93706#(<= main_~i~1 5), 93709#(<= main_~i~1 8), 93708#(<= main_~i~1 7), 93711#(<= main_~i~1 10), 93710#(<= main_~i~1 9), 93713#(<= main_~i~1 12), 93712#(<= main_~i~1 11), 93715#(<= main_~i~1 14), 93714#(<= main_~i~1 13), 93717#(<= main_~i~1 16), 93716#(<= main_~i~1 15), 93719#(<= main_~i~1 18), 93718#(<= main_~i~1 17), 93721#(<= main_~i~1 20), 93720#(<= main_~i~1 19), 93723#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21), 93722#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 21), 93725#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 93724#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 93727#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 93726#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 93729#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 93728#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 93731#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 93730#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 93733#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 93732#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 93735#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 93734#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 93737#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 93736#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 93739#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 93738#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 93741#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 93740#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 93743#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 93742#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 93745#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 93744#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 93746#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:58:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-10 14:58:26,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 14:58:26,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 14:58:26,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:58:26,103 INFO L87 Difference]: Start difference. First operand 1778 states and 1782 transitions. Second operand 48 states. [2018-04-10 14:58:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:26,970 INFO L93 Difference]: Finished difference Result 2076 states and 2085 transitions. [2018-04-10 14:58:26,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 14:58:26,970 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1768 [2018-04-10 14:58:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:26,973 INFO L225 Difference]: With dead ends: 2076 [2018-04-10 14:58:26,973 INFO L226 Difference]: Without dead ends: 2076 [2018-04-10 14:58:26,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1177, Invalid=3793, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 14:58:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2018-04-10 14:58:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2072. [2018-04-10 14:58:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-04-10 14:58:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2081 transitions. [2018-04-10 14:58:26,984 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2081 transitions. Word has length 1768 [2018-04-10 14:58:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:26,985 INFO L459 AbstractCegarLoop]: Abstraction has 2072 states and 2081 transitions. [2018-04-10 14:58:26,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 14:58:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2081 transitions. [2018-04-10 14:58:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-04-10 14:58:27,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:27,003 INFO L355 BasicCegarLoop]: trace histogram [294, 273, 272, 272, 272, 272, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:58:27,003 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1197311871, now seen corresponding path program 62 times [2018-04-10 14:58:27,004 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:27,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-04-10 14:58:34,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:34,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-10 14:58:34,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-10 14:58:34,318 INFO L182 omatonBuilderFactory]: Interpolants [97985#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 97984#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 97986#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 20), 97941#true, 97943#(<= 0 main_~i~1), 97942#false, 97945#(<= 2 main_~i~1), 97944#(<= 1 main_~i~1), 97947#(<= 4 main_~i~1), 97946#(<= 3 main_~i~1), 97949#(<= 6 main_~i~1), 97948#(<= 5 main_~i~1), 97951#(<= 8 main_~i~1), 97950#(<= 7 main_~i~1), 97953#(<= 10 main_~i~1), 97952#(<= 9 main_~i~1), 97955#(<= 12 main_~i~1), 97954#(<= 11 main_~i~1), 97957#(<= 14 main_~i~1), 97956#(<= 13 main_~i~1), 97959#(<= 16 main_~i~1), 97958#(<= 15 main_~i~1), 97961#(<= 18 main_~i~1), 97960#(<= 17 main_~i~1), 97963#(<= 20 main_~i~1), 97962#(<= 19 main_~i~1), 97965#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 97964#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 97967#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 97966#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 97969#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 97968#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 97971#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 97970#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 97973#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 97972#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 97975#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 97974#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 97977#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 97976#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 97979#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 97978#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 97981#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 97980#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 97983#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 97982#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18))] [2018-04-10 14:58:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-04-10 14:58:34,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:58:34,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:58:34,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1540, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:58:34,322 INFO L87 Difference]: Start difference. First operand 2072 states and 2081 transitions. Second operand 46 states. [2018-04-10 14:58:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:34,767 INFO L93 Difference]: Finished difference Result 1940 states and 1942 transitions. [2018-04-10 14:58:34,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 14:58:34,767 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1900 [2018-04-10 14:58:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:34,770 INFO L225 Difference]: With dead ends: 1940 [2018-04-10 14:58:34,770 INFO L226 Difference]: Without dead ends: 1919 [2018-04-10 14:58:34,771 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=990, Invalid=3300, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 14:58:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2018-04-10 14:58:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1916. [2018-04-10 14:58:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2018-04-10 14:58:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 1917 transitions. [2018-04-10 14:58:34,786 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 1917 transitions. Word has length 1900 [2018-04-10 14:58:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:34,787 INFO L459 AbstractCegarLoop]: Abstraction has 1916 states and 1917 transitions. [2018-04-10 14:58:34,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:58:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 1917 transitions. [2018-04-10 14:58:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-04-10 14:58:34,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:34,813 INFO L355 BasicCegarLoop]: trace histogram [296, 275, 274, 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-10 14:58:34,813 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1548555889, now seen corresponding path program 63 times [2018-04-10 14:58:34,814 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:34,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-04-10 14:58:39,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:39,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 14:58:39,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:39,302 INFO L182 omatonBuilderFactory]: Interpolants [101889#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 101888#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 101891#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 101890#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 101893#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 101892#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 101895#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 101894#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 101897#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 101896#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 101899#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 101898#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 101901#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 101900#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 101903#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 101902#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 101905#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 101904#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 101907#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 101906#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 101908#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 101883#true, 101885#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 101884#false, 101887#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 101886#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)] [2018-04-10 14:58:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-04-10 14:58:39,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:58:39,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:58:39,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:58:39,305 INFO L87 Difference]: Start difference. First operand 1916 states and 1917 transitions. Second operand 26 states. [2018-04-10 14:58:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:39,639 INFO L93 Difference]: Finished difference Result 1928 states and 1930 transitions. [2018-04-10 14:58:39,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:58:39,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1912 [2018-04-10 14:58:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:39,642 INFO L225 Difference]: With dead ends: 1928 [2018-04-10 14:58:39,642 INFO L226 Difference]: Without dead ends: 1928 [2018-04-10 14:58:39,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:58:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-04-10 14:58:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1922. [2018-04-10 14:58:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-04-10 14:58:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 1924 transitions. [2018-04-10 14:58:39,652 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 1924 transitions. Word has length 1912 [2018-04-10 14:58:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:39,652 INFO L459 AbstractCegarLoop]: Abstraction has 1922 states and 1924 transitions. [2018-04-10 14:58:39,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:58:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 1924 transitions. [2018-04-10 14:58:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-04-10 14:58:39,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:39,671 INFO L355 BasicCegarLoop]: trace histogram [297, 276, 275, 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-10 14:58:39,672 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash -29417367, now seen corresponding path program 64 times [2018-04-10 14:58:39,672 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:39,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-04-10 14:58:47,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:47,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 14:58:47,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:47,487 INFO L182 omatonBuilderFactory]: Interpolants [105801#true, 105803#(= main_~i~1 0), 105802#false, 105805#(<= main_~i~1 2), 105804#(<= main_~i~1 1), 105807#(<= main_~i~1 4), 105806#(<= main_~i~1 3), 105809#(<= main_~i~1 6), 105808#(<= main_~i~1 5), 105811#(<= main_~i~1 8), 105810#(<= main_~i~1 7), 105813#(<= main_~i~1 10), 105812#(<= main_~i~1 9), 105815#(<= main_~i~1 12), 105814#(<= main_~i~1 11), 105817#(<= main_~i~1 14), 105816#(<= main_~i~1 13), 105819#(<= main_~i~1 16), 105818#(<= main_~i~1 15), 105821#(<= main_~i~1 18), 105820#(<= main_~i~1 17), 105823#(<= main_~i~1 20), 105822#(<= main_~i~1 19), 105825#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 22), 105824#(<= main_~i~1 21), 105827#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 105826#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22), 105829#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 105828#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 105831#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 105830#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 105833#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 105832#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 105835#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 105834#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 105837#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 105836#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 105839#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 105838#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 105841#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 105840#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 105843#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 105842#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 105845#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 105844#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 105847#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 105846#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 105849#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 105848#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 105850#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-10 14:58:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-04-10 14:58:47,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 14:58:47,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 14:58:47,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:58:47,490 INFO L87 Difference]: Start difference. First operand 1922 states and 1924 transitions. Second operand 50 states. [2018-04-10 14:58:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:48,452 INFO L93 Difference]: Finished difference Result 2074 states and 2077 transitions. [2018-04-10 14:58:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 14:58:48,452 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1918 [2018-04-10 14:58:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:48,457 INFO L225 Difference]: With dead ends: 2074 [2018-04-10 14:58:48,457 INFO L226 Difference]: Without dead ends: 2074 [2018-04-10 14:58:48,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1276, Invalid=4126, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 14:58:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2018-04-10 14:58:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2072. [2018-04-10 14:58:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-04-10 14:58:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2075 transitions. [2018-04-10 14:58:48,467 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2075 transitions. Word has length 1918 [2018-04-10 14:58:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:48,468 INFO L459 AbstractCegarLoop]: Abstraction has 2072 states and 2075 transitions. [2018-04-10 14:58:48,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 14:58:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2075 transitions. [2018-04-10 14:58:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2018-04-10 14:58:48,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:48,496 INFO L355 BasicCegarLoop]: trace histogram [320, 298, 297, 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-10 14:58:48,496 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1148758297, now seen corresponding path program 65 times [2018-04-10 14:58:48,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:48,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:58:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 75983 proven. 1430 refuted. 0 times theorem prover too weak. 203208 trivial. 0 not checked. [2018-04-10 14:58:57,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:58:57,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 14:58:57,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:58:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:58:57,426 INFO L182 omatonBuilderFactory]: Interpolants [110081#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 110080#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 110083#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 110082#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 110085#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 110084#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 110087#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 110086#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 110089#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 110088#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 110091#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 110090#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 110092#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 21), 110045#true, 110047#(<= 0 main_~i~1), 110046#false, 110049#(<= 2 main_~i~1), 110048#(<= 1 main_~i~1), 110051#(<= 4 main_~i~1), 110050#(<= 3 main_~i~1), 110053#(<= 6 main_~i~1), 110052#(<= 5 main_~i~1), 110055#(<= 8 main_~i~1), 110054#(<= 7 main_~i~1), 110057#(<= 10 main_~i~1), 110056#(<= 9 main_~i~1), 110059#(<= 12 main_~i~1), 110058#(<= 11 main_~i~1), 110061#(<= 14 main_~i~1), 110060#(<= 13 main_~i~1), 110063#(<= 16 main_~i~1), 110062#(<= 15 main_~i~1), 110065#(<= 18 main_~i~1), 110064#(<= 17 main_~i~1), 110067#(<= 20 main_~i~1), 110066#(<= 19 main_~i~1), 110069#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 110068#(<= 21 main_~i~1), 110071#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 110070#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 110073#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 110072#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 110075#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 110074#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 110077#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 110076#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 110079#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 110078#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9))] [2018-04-10 14:58:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 75983 proven. 1430 refuted. 0 times theorem prover too weak. 203208 trivial. 0 not checked. [2018-04-10 14:58:57,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 14:58:57,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 14:58:57,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1679, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:58:57,430 INFO L87 Difference]: Start difference. First operand 2072 states and 2075 transitions. Second operand 48 states. [2018-04-10 14:58:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:58:58,116 INFO L93 Difference]: Finished difference Result 2081 states and 2082 transitions. [2018-04-10 14:58:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 14:58:58,116 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2062 [2018-04-10 14:58:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:58:58,119 INFO L225 Difference]: With dead ends: 2081 [2018-04-10 14:58:58,119 INFO L226 Difference]: Without dead ends: 2075 [2018-04-10 14:58:58,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1081, Invalid=3611, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 14:58:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2018-04-10 14:58:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2072. [2018-04-10 14:58:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-04-10 14:58:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2073 transitions. [2018-04-10 14:58:58,129 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2073 transitions. Word has length 2062 [2018-04-10 14:58:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:58:58,130 INFO L459 AbstractCegarLoop]: Abstraction has 2072 states and 2073 transitions. [2018-04-10 14:58:58,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 14:58:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2073 transitions. [2018-04-10 14:58:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2069 [2018-04-10 14:58:58,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:58:58,157 INFO L355 BasicCegarLoop]: trace histogram [321, 299, 298, 298, 298, 298, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:58:58,158 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:58:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1453135599, now seen corresponding path program 66 times [2018-04-10 14:58:58,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:58:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:58:58,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 282450 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241032 trivial. 0 not checked. [2018-04-10 14:59:03,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:03,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 14:59:03,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:03,789 INFO L182 omatonBuilderFactory]: Interpolants [114305#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 114304#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 114307#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 114306#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 114309#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 114308#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 114311#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 114310#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 114313#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 114312#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 114314#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 114289#false, 114288#true, 114291#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 114290#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 114293#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 114292#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 114295#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 114294#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 114297#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 114296#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 114299#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 114298#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 114301#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 114300#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 114303#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 114302#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)] [2018-04-10 14:59:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 282450 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241032 trivial. 0 not checked. [2018-04-10 14:59:03,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 14:59:03,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 14:59:03,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=396, Unknown=0, NotChecked=0, Total=702 [2018-04-10 14:59:03,793 INFO L87 Difference]: Start difference. First operand 2072 states and 2073 transitions. Second operand 27 states. [2018-04-10 14:59:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:04,140 INFO L93 Difference]: Finished difference Result 2084 states and 2086 transitions. [2018-04-10 14:59:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:59:04,140 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 2068 [2018-04-10 14:59:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:04,143 INFO L225 Difference]: With dead ends: 2084 [2018-04-10 14:59:04,144 INFO L226 Difference]: Without dead ends: 2084 [2018-04-10 14:59:04,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 14:59:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2018-04-10 14:59:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2078. [2018-04-10 14:59:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2018-04-10 14:59:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2080 transitions. [2018-04-10 14:59:04,153 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2080 transitions. Word has length 2068 [2018-04-10 14:59:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:04,154 INFO L459 AbstractCegarLoop]: Abstraction has 2078 states and 2080 transitions. [2018-04-10 14:59:04,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 14:59:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2080 transitions. [2018-04-10 14:59:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2075 [2018-04-10 14:59:04,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:04,176 INFO L355 BasicCegarLoop]: trace histogram [322, 300, 299, 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-10 14:59:04,176 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:59:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1410628361, now seen corresponding path program 67 times [2018-04-10 14:59:04,176 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:04,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 284285 backedges. 43204 proven. 1545 refuted. 0 times theorem prover too weak. 239536 trivial. 0 not checked. [2018-04-10 14:59:13,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:13,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-10 14:59:13,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:13,784 INFO L182 omatonBuilderFactory]: Interpolants [118529#(<= main_~i~1 6), 118528#(<= main_~i~1 5), 118531#(<= main_~i~1 8), 118530#(<= main_~i~1 7), 118533#(<= main_~i~1 10), 118532#(<= main_~i~1 9), 118535#(<= main_~i~1 12), 118534#(<= main_~i~1 11), 118537#(<= main_~i~1 14), 118536#(<= main_~i~1 13), 118539#(<= main_~i~1 16), 118538#(<= main_~i~1 15), 118541#(<= main_~i~1 18), 118540#(<= main_~i~1 17), 118543#(<= main_~i~1 20), 118542#(<= main_~i~1 19), 118545#(<= main_~i~1 22), 118544#(<= main_~i~1 21), 118547#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23), 118546#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 23), 118549#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 118548#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 118551#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 118550#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 118553#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 118552#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 118555#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 118554#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 118557#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 118556#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 118559#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 118558#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 118561#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 118560#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 118563#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 118562#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 118565#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 118564#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 118567#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 118566#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 118569#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 118568#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 118571#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 118570#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 118572#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 118521#true, 118523#(= main_~i~1 0), 118522#false, 118525#(<= main_~i~1 2), 118524#(<= main_~i~1 1), 118527#(<= main_~i~1 4), 118526#(<= main_~i~1 3)] [2018-04-10 14:59:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 284285 backedges. 43204 proven. 1545 refuted. 0 times theorem prover too weak. 239536 trivial. 0 not checked. [2018-04-10 14:59:13,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 14:59:13,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 14:59:13,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=1998, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:59:13,787 INFO L87 Difference]: Start difference. First operand 2078 states and 2080 transitions. Second operand 52 states. [2018-04-10 14:59:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:14,684 INFO L93 Difference]: Finished difference Result 2236 states and 2239 transitions. [2018-04-10 14:59:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 14:59:14,684 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2074 [2018-04-10 14:59:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:14,687 INFO L225 Difference]: With dead ends: 2236 [2018-04-10 14:59:14,687 INFO L226 Difference]: Without dead ends: 2236 [2018-04-10 14:59:14,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1379, Invalid=4473, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 14:59:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2018-04-10 14:59:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2234. [2018-04-10 14:59:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-04-10 14:59:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2237 transitions. [2018-04-10 14:59:14,698 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2237 transitions. Word has length 2074 [2018-04-10 14:59:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:14,699 INFO L459 AbstractCegarLoop]: Abstraction has 2234 states and 2237 transitions. [2018-04-10 14:59:14,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 14:59:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2237 transitions. [2018-04-10 14:59:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2225 [2018-04-10 14:59:14,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:14,718 INFO L355 BasicCegarLoop]: trace histogram [346, 323, 322, 322, 322, 322, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:59:14,718 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:59:14,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1590184015, now seen corresponding path program 68 times [2018-04-10 14:59:14,719 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:14,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 329061 backedges. 86211 proven. 1564 refuted. 0 times theorem prover too weak. 241286 trivial. 0 not checked. [2018-04-10 14:59:25,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:25,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 14:59:25,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:25,543 INFO L182 omatonBuilderFactory]: Interpolants [123137#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 123136#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 123139#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 123138#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 123141#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 123140#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 123142#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 22), 123093#true, 123095#(<= 0 main_~i~1), 123094#false, 123097#(<= 2 main_~i~1), 123096#(<= 1 main_~i~1), 123099#(<= 4 main_~i~1), 123098#(<= 3 main_~i~1), 123101#(<= 6 main_~i~1), 123100#(<= 5 main_~i~1), 123103#(<= 8 main_~i~1), 123102#(<= 7 main_~i~1), 123105#(<= 10 main_~i~1), 123104#(<= 9 main_~i~1), 123107#(<= 12 main_~i~1), 123106#(<= 11 main_~i~1), 123109#(<= 14 main_~i~1), 123108#(<= 13 main_~i~1), 123111#(<= 16 main_~i~1), 123110#(<= 15 main_~i~1), 123113#(<= 18 main_~i~1), 123112#(<= 17 main_~i~1), 123115#(<= 20 main_~i~1), 123114#(<= 19 main_~i~1), 123117#(<= 22 main_~i~1), 123116#(<= 21 main_~i~1), 123119#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 123118#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 123121#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 123120#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 123123#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 123122#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 123125#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 123124#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 123127#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 123126#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 123129#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 123128#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 123131#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 123130#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 123133#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 123132#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 123135#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 123134#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16))] [2018-04-10 14:59:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 329061 backedges. 86211 proven. 1564 refuted. 0 times theorem prover too weak. 241286 trivial. 0 not checked. [2018-04-10 14:59:25,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 14:59:25,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 14:59:25,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1824, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:59:25,547 INFO L87 Difference]: Start difference. First operand 2234 states and 2237 transitions. Second operand 50 states. [2018-04-10 14:59:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:26,165 INFO L93 Difference]: Finished difference Result 2243 states and 2244 transitions. [2018-04-10 14:59:26,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 14:59:26,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2224 [2018-04-10 14:59:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:26,168 INFO L225 Difference]: With dead ends: 2243 [2018-04-10 14:59:26,168 INFO L226 Difference]: Without dead ends: 2237 [2018-04-10 14:59:26,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1176, Invalid=3936, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 14:59:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2018-04-10 14:59:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2234. [2018-04-10 14:59:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-04-10 14:59:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2235 transitions. [2018-04-10 14:59:26,179 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2235 transitions. Word has length 2224 [2018-04-10 14:59:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:26,179 INFO L459 AbstractCegarLoop]: Abstraction has 2234 states and 2235 transitions. [2018-04-10 14:59:26,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 14:59:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2235 transitions. [2018-04-10 14:59:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2231 [2018-04-10 14:59:26,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:26,199 INFO L355 BasicCegarLoop]: trace histogram [347, 324, 323, 323, 323, 323, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:59:26,200 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:59:26,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1264821673, now seen corresponding path program 69 times [2018-04-10 14:59:26,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:26,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 331042 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284211 trivial. 0 not checked. [2018-04-10 14:59:32,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:32,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 14:59:32,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:32,525 INFO L182 omatonBuilderFactory]: Interpolants [127681#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 127680#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 127683#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 127682#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 127685#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 127684#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 127687#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20) (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127686#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 127689#(and (<= 6 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 127688#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21) (<= 5 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127691#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24) (<= 8 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127690#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23) (<= 7 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127665#false, 127664#true, 127667#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 127666#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 127669#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 127668#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 127671#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 127670#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 127673#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 127672#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 127675#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 127674#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 127677#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 127676#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 127679#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 127678#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)] [2018-04-10 14:59:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 331042 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284211 trivial. 0 not checked. [2018-04-10 14:59:32,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:59:32,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:59:32,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:59:32,529 INFO L87 Difference]: Start difference. First operand 2234 states and 2235 transitions. Second operand 28 states. [2018-04-10 14:59:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:33,094 INFO L93 Difference]: Finished difference Result 2246 states and 2248 transitions. [2018-04-10 14:59:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 14:59:33,095 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 2230 [2018-04-10 14:59:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:33,098 INFO L225 Difference]: With dead ends: 2246 [2018-04-10 14:59:33,098 INFO L226 Difference]: Without dead ends: 2246 [2018-04-10 14:59:33,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=644, Invalid=1906, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 14:59:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-04-10 14:59:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2240. [2018-04-10 14:59:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2018-04-10 14:59:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2242 transitions. [2018-04-10 14:59:33,109 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2242 transitions. Word has length 2230 [2018-04-10 14:59:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:33,109 INFO L459 AbstractCegarLoop]: Abstraction has 2240 states and 2242 transitions. [2018-04-10 14:59:33,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:59:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2242 transitions. [2018-04-10 14:59:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2237 [2018-04-10 14:59:33,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:33,130 INFO L355 BasicCegarLoop]: trace histogram [348, 325, 324, 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-10 14:59:33,130 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 14:59:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash -229939807, now seen corresponding path program 70 times [2018-04-10 14:59:33,131 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:33,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-10 14:59:36,842 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-10 14:59:36,845 INFO L168 Benchmark]: Toolchain (without parser) took 181370.07 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 345.5 MB in the beginning and 816.5 MB in the end (delta: -470.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-04-10 14:59:36,846 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 405.3 MB. Free memory is still 368.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:59:36,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.15 ms. Allocated memory is still 405.3 MB. Free memory was 345.5 MB in the beginning and 334.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-10 14:59:36,846 INFO L168 Benchmark]: Boogie Preprocessor took 25.18 ms. Allocated memory is still 405.3 MB. Free memory was 334.9 MB in the beginning and 333.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 14:59:36,846 INFO L168 Benchmark]: RCFGBuilder took 250.49 ms. Allocated memory was 405.3 MB in the beginning and 615.0 MB in the end (delta: 209.7 MB). Free memory was 333.6 MB in the beginning and 576.4 MB in the end (delta: -242.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. [2018-04-10 14:59:36,847 INFO L168 Benchmark]: TraceAbstraction took 180940.88 ms. Allocated memory was 615.0 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 576.4 MB in the beginning and 816.5 MB in the end (delta: -240.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-04-10 14:59:36,848 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.24 ms. Allocated memory is still 405.3 MB. Free memory is still 368.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.15 ms. Allocated memory is still 405.3 MB. Free memory was 345.5 MB in the beginning and 334.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.18 ms. Allocated memory is still 405.3 MB. Free memory was 334.9 MB in the beginning and 333.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 250.49 ms. Allocated memory was 405.3 MB in the beginning and 615.0 MB in the end (delta: 209.7 MB). Free memory was 333.6 MB in the beginning and 576.4 MB in the end (delta: -242.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 180940.88 ms. Allocated memory was 615.0 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 576.4 MB in the beginning and 816.5 MB in the end (delta: -240.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-59-36-853.csv Completed graceful shutdown